کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
384853 660855 2012 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Using linear programming to solve clustered oversubscription planning problems for designing e-courses
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Using linear programming to solve clustered oversubscription planning problems for designing e-courses
چکیده انگلیسی

The automatic generation of individualized plans in specific domains is an open problem that combines aspects related to automated planning, machine learning or recommendation systems technology. In this paper, we focus on a specific instance of that task; that of generating e-learning courses adapted to students’ profiles, within the automated planning paradigm. One of the open problems in this type of automated planning application relates to what is known as oversubscription: given a set of goals, each one with a utility, obtain a plan that achieves some (or all) the goals, maximizing the utility, as well as minimizing the cost of achieving those goals. In the generation of e-learning designs there is only one goal: generating a course design for a given student. However, in order to achieve the goal, the course design can include many different kinds of activities, each one with a utility (that depend on the student profile) and cost. Furthermore, these activities are usually grouped into clusters, so that at least one of the activities in each cluster is needed, though many more can be used. Finally, there is also an overall cost threshold (usually in terms of student time). In this paper, we present our work on building an individualized e-learning design. We pose each course design as a variation of the oversubscription problem, that we call the clustered-oversubscription problem, and we use linear programming for assisting a planner to generate the design that better adapts to the student.


► Generation of individualized e-learning designs using AI planning and linear programming.
► Modelling e-learning tasks as clustered-oversubscription planning problems.
► Generic approach for solving clustered-oversubscription problems.
► Experimental results show validity of approach.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 39, Issue 5, April 2012, Pages 5178–5188
نویسندگان
, ,