Analysis of students' study paths using finite Markov chains

Student's studies can be seen as consisting of chains or sequences of courses, the learning activities of a student along these lines make his study path. In this paper, methods for detection, analysis and control of learning activities are developed, based on students' credit record data. A central aim of the work is to support the supervision of students using currently available data bases.

[1]  Kenneth A. Strike,et al.  An Analysis of Curriculum Structure. , 1974 .

[2]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[3]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[4]  Jong Min Lee,et al.  Approximate Dynamic Programming Strategies and Their Applicability for Process Control: A Review and Future Directions , 2004 .

[5]  Alexander S. Poznyak,et al.  Self-Learning Control of Finite Markov Chains , 2000 .

[6]  R.E. Fehr,et al.  A model curriculum for power engineering , 2008, 2008 IEEE Power and Energy Society General Meeting - Conversion and Delivery of Electrical Energy in the 21st Century.

[7]  Conversion and delivery of electrical energy in the 21st century , 2008, 2008 IEEE Power and Energy Society General Meeting - Conversion and Delivery of Electrical Energy in the 21st Century.

[8]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[9]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .