RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2014 Issue 4, Pages 20–37 (Mi at7529)

This article is cited in 13 papers

Mathematical programming problems

Using the maximum likelihood method to estimate test complexity levels

A. I. Kibzun, A. O. Inozemtsev

Moscow State Aviation Institute, Moscow, Russia

Abstract: Consideration was given to the problem of estimating the levels of complexity of the test tasks for the remote education system. It was assumed that the random responses of the subjects obey the logistic distribution and the levels of student readiness are not known in advance. An algorithm based on the methods of maximum likelihood and Broyden–Fletcher–Goldfarb–Shanno was proposed to calculate the task complexity. Strict concavity of the logarithmic likelihood function was established, and an example was considered.

Presented by the member of Editorial Board: A. V. Nazin

Received: 14.11.2013


 English version:
Automation and Remote Control, 2014, 75:4, 607–621

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026