A heuristic method for curriculum planning based on students’ interest

Nowadays scheduling courses in universities could be a challenge for university authorities due to time interferences, students’ preferring and teachers’ and student’s limitations. This paper addresses the inefficient course schedule challenge and proposes a practical heuristic method to overcome it. Discovering students’ favorite courses and courses that are picked together usually could be informative for university authorities. In this paper we try to discover students’ favorite courses, using their educational data and correlation analysis and frequent pattern mining, and then, using this knowledge to help scheduling courses so that all students can have the optimal curriculum.

Keywords:

Educational data mining , Learning analytics , Course scheduling , students’ interest.