Abstract
We study the problem of estimating the complexity levels of test problems and levels of preparation of the students that arises in learning management systems. To solve the problem, we propose two algorithms for processing test results. The first algorithm is based on the assumption that random answers of the test takers are described by a logistic distribution. To compute test problem complexities and levels of preparation of the students, we use the maximum likelihood method and the quasi-Newton Broyden–Fletcher–Goldfarb–Shanno optimization method, where the likelihood function is constructed in a special way based on Rasch’s model. The second algorithm is heuristic and is based on recurrent recomputation of initial estimates obtained by adding up the positive answers of students separately by columns and rows of the matrix of answers, where columns correspond to answers of all students for a specific test, and rows correspond to answers of a specific student for all tests. We consider an example where we compare the results of applying the proposed algorithms.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Kibzun, A.I., Karolinskaya, S.N., and Shayukov, R.I., A Remote Study System for Mathematical Disciplines in the University, Vestn. Komp’yut. Inform. Tekhnol., 2006, no. 4, pp. 29–36.
Kibzun, A.I. and Panarin, S.I., Generation of Integral Rating by Statistical Processing of the Test Results, Autom. Remote Control, 2012, vol. 73, no. 6. pp. 1029–1045.
Rasch, G., Probabilistic Models for Some Intelligence and Attainment Tests, Chicago: Univ. of Chicago Press, 1980.
Kibzun, A.I. and Inozemtsev, A.O., Using the Maximum Likelihood Method to Estimate Test Complexity Levels, Autom. Remote Control, 2014, vol. 75, no. 4, pp. 607–621.
Nocedal, J. and Wright, S.J., Numerical Optimization, New York: Springer, 2006, 2nd ed.
Kibzun, A.I., Vishnyakov, B.V., and Panarin, S.I., Interface of a Remote Study System for Mathematical Disciplines, Vestn. Komp’yut. Inform. Tekhnol., 2008, no. 10, pp. 43–48.
Ivchenko, G.I. and Medvedev, Yu.I., Matematicheskaya statistika (Mathematical Statistics), Moscow: Vysshaya Shkola, 1984.
Polyak, B.T., Vvedenie v optimizatsiyu (Introduction to Optimization), Moscow: Nauka, 1983.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.I. Kibzun, E.A. Zharkov, 2017, published in Avtomatika i Telemekhanika, 2017, No. 12, pp. 84–99.
This paper was recommended for publication by P.V. Pakshin, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Kibzun, A.I., Zharkov, E.A. Two algorithms for estimating test complexity levels. Autom Remote Control 78, 2165–2177 (2017). https://doi.org/10.1134/S0005117917120050
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117917120050