An anomaly detection of learning behaviour data based on discrete Markov chain Online publication date: Tue, 20-Dec-2022
by Dahui Li; Peng Qu; Tao Jin; Changchun Chen; Yunfei Bai
International Journal of Continuing Engineering Education and Life-Long Learning (IJCEELL), Vol. 33, No. 1, 2023
Abstract: In order to overcome the problems of large anomaly detection error and long detection time in traditional learning behaviour data anomaly detection methods, this paper proposes a learning behaviour data anomaly detection method based on discrete Markov chain. This method analyses the types of learning behaviour data, and determines the influencing factors of learning behaviour data. With the help of support vector machine, the data extraction range is determined, and the data redundancy is determined to complete the data pre-processing. This paper analyses the basic principle of discrete Markov chain, constructs the discrete Markov chain model, and completes the detection of abnormal learning behaviour data. The experimental results show that the maximum detection error of the proposed method is about 2%, and the detection time is always less than 2.5 s.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Continuing Engineering Education and Life-Long Learning (IJCEELL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook