Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Avtomatika i Telemekhanika, 2017, Issue 12, Pages 84–99 (Mi at14951)  

This article is cited in 2 scientific papers (total in 2 papers)

Stochastic Systems

Two algorithms for estimating test complexity levels

A. I. Kibzun, E. A. Zharkov

Moscow Aviation Institute, Moscow, Russia
Full-text PDF (646 kB) Citations (2)
References:
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.
Keywords: maximal likelihood method, recurrent recomputation, test complexity levels, levels of preparation of the students.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 2.2461.2017/ПЧ
This work was done as part of fulfilling the Government contract by the Russian Ministry of Science and Education no. 2.2461.2017/PCh.
Presented by the member of Editorial Board: P. V. Pakshin

Received: 07.12.2016
English version:
Automation and Remote Control, 2017, Volume 78, Issue 12, Pages 2165–2177
DOI: https://doi.org/10.1134/S0005117917120050
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: A. I. Kibzun, E. A. Zharkov, “Two algorithms for estimating test complexity levels”, Avtomat. i Telemekh., 2017, no. 12, 84–99; Autom. Remote Control, 78:12 (2017), 2165–2177
Citation in format AMSBIB
\Bibitem{KibZha17}
\by A.~I.~Kibzun, E.~A.~Zharkov
\paper Two algorithms for estimating test complexity levels
\jour Avtomat. i Telemekh.
\yr 2017
\issue 12
\pages 84--99
\mathnet{http://mi.mathnet.ru/at14951}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1622199}
\elib{https://elibrary.ru/item.asp?id=30718060}
\transl
\jour Autom. Remote Control
\yr 2017
\vol 78
\issue 12
\pages 2165--2177
\crossref{https://doi.org/10.1134/S0005117917120050}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000417864100005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85038418969}
Linking options:
  • https://www.mathnet.ru/eng/at14951
  • https://www.mathnet.ru/eng/at/y2017/i12/p84
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:245
    Full-text PDF :45
    References:28
    First page:12
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024