A heuristic method for curriculum planning based on students’ interest

سال انتشار: 1398
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 452

فایل این مقاله در 7 صفحه با فرمت PDF و WORD قابل دریافت می باشد

این مقاله در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ICEEI06_012

تاریخ نمایه سازی: 27 آذر 1398

چکیده مقاله:

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.

نویسندگان

B Behkamal,

Assistant Professor at Computer Engineering Department, Ferdowsi University of Mashhad, Mashhad, Iran

B Bolourian Haghighi

PhD student at Computer Engineering Department, Ferdowsi University of Mashhad, Mashhad, Iran

A. Tavakoli Haghighi

Master student at Computer Engineering Department, Ferdowsi University of Mashhad, Mashhad, Iran