Two algorithms for estimating test complexity levels

DOI10.1134/S0005117917120050MaRDI QIDQ2412968zbMATH OpenOpenAlexFDO

Authors A. I. Kibzun, E. A. Zharkov

Publication date 6 April 2018

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117917120050

zbMATH Keywords

levels of preparation of the studentsmaximal likelihood methodrecurrent recomputationtest complexity levels

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Application models in control theory (93C95) Estimation and detection in stochastic control theory (93E10)

Recommendations

• Using the maximum likelihood method to estimate test complexity levels
• Generation of integral rating by statistical processing of the test results
• Tests and intervals in multiple choice tests: A modification of the simplest classical model
• On the problem of probabilistic optimization of time-limited testing
• Publication:4890991

Cites work

• Generation of integral rating by statistical processing of the test results
• scientific article; zbMATH DE number 3984289 (Why is no real title available?)
• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Using the maximum likelihood method to estimate test complexity levels

Cited in

(4)

• Difficulties in the evaluation of solving algorithms
• Using the maximum likelihood method to estimate test complexity levels
• On the problem of probabilistic optimization of time-limited testing
• Algorithmic bases of automated management by the professional standard of the bachelor

This page was built for publication: Two algorithms for estimating test complexity levels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412968)