A study of marking utility models based on principal component analysis and integer programming

Authors

  • Nanning Chen
  • Zikai Dong
  • Huiyuan Yang
  • Fuchun Li
  • Xinyu Ma

DOI:

https://doi.org/10.54097/hset.v62i.10436

Keywords:

Principal component analysis, integer programming, simulated annealing algorithms, non-linear fitting, characteristic indicators.

Abstract

The establishment and analysis of a marking utility model is of great importance in achieving paperless marking and improving the accuracy and efficiency of marking. Through the application of modern technology, students' examination results can be evaluated more objectively and provide an important basis for determining the final effect of talent training. This paper provides a systematic analysis and modelling of the marking process, and uses a variety of techniques and methods to address the issue of marking staff arrangements. Firstly, the impact of the proportion of markers per question, the proportion of the average mark for each question to the total mark for that question, the proportion of blank papers and the error rate on the speed of marking was explored by analysing marker-related indicator variables and the basic requirements for completing the marking process. Then, principal component analysis was used to reduce the dimensionality of the four factor variables affecting marking speed, and two principal components with strong correlation with marking speed were obtained to provide a more systematic and comprehensive analysis of the influence of marking speed. Finally, an integer programming model and simulated annealing algorithm were used to solve for the optimal arrangement of markers to ensure that the requirement of simultaneous completion of workload for each question was met. In this paper, the optimal allocation of markers is analysed and the time required for all markers to complete the marking process at the same point in time is calculated to be 3.3 days. Two optimal allocations of markers are proposed for each question type per day and for each question type per hour in a day.

Downloads

Download data is not yet available.

References

Zhang W, Wang HB, Zhao Y. (2018) Research on automatic scoring model based on deep learning. Computer Science and Exploration, 12(6), 873-884.

Singh, R., Saleh, M., & Ng, A. (2017) Gradescope: A Fast, Flexible, and Fair System for Scalable Assessment of Handwritten Work. Proceedings of the Fourth ACM Conference on Learning at Scale, 365-368.

Ramanathan, A., & Chakraborty, T. (2020) A Semantic Similarity Based Approach for Automated Paperless Grading. 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), 71-78.

Rohde, H., & Schlangen, D. (2017) Evaluating the Quality of Automatically Evaluated Long-Text Answers in E-Assessment. Proceedings of the 12th Workshop on Innovative Use of NLP for Building Educational Applications, 146-155.

Koichi Yamamoto, Tomoaki Takagi, Hidetoshi Saito. (2019) An intelligent scoring method based on knowledge graphs. Research Report of the Computer Society of Japan, 2019(9), 1-8.

Downloads

Published

27-07-2023