Skip to Main content Skip to Navigation
Journal articles

Detection of Cheating by Decimation Algorithm

Yamanaka Shogo 1 Masayuki Ohzeki 2 Aurélien Decelle 3, 4, 5
1 Department of Mechanical Engineering and Science, Kyoto University
Department of Mechanical Engineering and Science
3 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : We expand the item response theory to study the case of "cheating students" for a set of exams, trying to detect them by applying a greedy algorithm of inference. This extended model is closely related to the Boltzmann machine learning. In this paper we aim to infer the correct biases and interactions of our model by considering a relatively small number of sets of training data. Nevertheless, the greedy algorithm that we employed in the present study exhibits good performance with a few number of training data. The key point is the sparseness of the interactions in our problem in the context of the Boltzmann machine learning: the existence of cheating students is expected to be very rare (possibly even in real world). We compare a standard approach to infer the sparse interactions in the Boltzmann machine learning to our greedy algorithm and we find the latter to be superior in several aspects.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download
Contributor : Aurélien Decelle <>
Submitted on : Thursday, January 29, 2015 - 11:43:27 AM
Last modification on : Wednesday, September 16, 2020 - 5:09:18 PM
Long-term archiving on: : Thursday, April 30, 2015 - 10:15:12 AM


Files produced by the author(s)




Yamanaka Shogo, Masayuki Ohzeki, Aurélien Decelle. Detection of Cheating by Decimation Algorithm. Journal of the Physical Society of Japan, Physical Society of Japan 日本物理学会, 2015, 84, pp.024801. ⟨10.7566/JPSJ.84.024801⟩. ⟨hal-01105415⟩



Record views


Files downloads