{"title":"RUTICO:在时间限制下推荐成功的学习路径","authors":"A. Nabizadeh, A. Jorge, J. P. Leal","doi":"10.1145/3099023.3099035","DOIUrl":null,"url":null,"abstract":"Nowadays using E-learning platforms such as Intelligent Tutoring Systems (ITS) that support users to learn subjects are quite common. Despite the availability and the advantages of these systems, they ignore the learners' time limitation for learning a subject. In this paper we propose RUTICO, that recommends successful learning paths with respect to a learner's knowledge background and under a time constraint. RUTICO, which is an example of Long Term goal Recommender Systems (LTRS), after locating a learner in the course graph, it utilizes a Depth-first search (DFS) algorithm to find all possible paths for a learner given a time restriction. RUTICO also estimates learning time and score for the paths and finally, it recommends a path with the maximum score that satisfies the learner time restriction. In order to evaluate the ability of RUTICO in estimating time and score for paths, we used the Mean Absolute Error and Error. Our results show that we are able to generate a learning path that maximizes a learner's score under a time restriction.","PeriodicalId":219391,"journal":{"name":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","volume":"7 17","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"RUTICO: Recommending Successful Learning Paths Under Time Constraints\",\"authors\":\"A. Nabizadeh, A. Jorge, J. P. Leal\",\"doi\":\"10.1145/3099023.3099035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays using E-learning platforms such as Intelligent Tutoring Systems (ITS) that support users to learn subjects are quite common. Despite the availability and the advantages of these systems, they ignore the learners' time limitation for learning a subject. In this paper we propose RUTICO, that recommends successful learning paths with respect to a learner's knowledge background and under a time constraint. RUTICO, which is an example of Long Term goal Recommender Systems (LTRS), after locating a learner in the course graph, it utilizes a Depth-first search (DFS) algorithm to find all possible paths for a learner given a time restriction. RUTICO also estimates learning time and score for the paths and finally, it recommends a path with the maximum score that satisfies the learner time restriction. In order to evaluate the ability of RUTICO in estimating time and score for paths, we used the Mean Absolute Error and Error. Our results show that we are able to generate a learning path that maximizes a learner's score under a time restriction.\",\"PeriodicalId\":219391,\"journal\":{\"name\":\"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization\",\"volume\":\"7 17\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3099023.3099035\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3099023.3099035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
摘要
如今,使用智能辅导系统(ITS)等支持用户学习科目的电子学习平台是相当普遍的。尽管这些系统具有可用性和优势,但它们忽略了学习者学习一门学科的时间限制。在本文中,我们提出了RUTICO,它根据学习者的知识背景和时间限制推荐成功的学习路径。RUTICO是长期目标推荐系统(Long Term goal Recommender Systems, LTRS)的一个例子,它在课程图中找到一个学习者后,利用深度优先搜索(deep -first search, DFS)算法,在给定的时间限制下,找到一个学习者的所有可能路径。RUTICO还会估计路径的学习时间和分数,最后,它会推荐一条满足学习者时间限制的分数最高的路径。为了评估RUTICO在估计路径时间和分数方面的能力,我们使用了平均绝对误差和误差。我们的结果表明,我们能够生成一个学习路径,在时间限制下最大化学习者的分数。
RUTICO: Recommending Successful Learning Paths Under Time Constraints
Nowadays using E-learning platforms such as Intelligent Tutoring Systems (ITS) that support users to learn subjects are quite common. Despite the availability and the advantages of these systems, they ignore the learners' time limitation for learning a subject. In this paper we propose RUTICO, that recommends successful learning paths with respect to a learner's knowledge background and under a time constraint. RUTICO, which is an example of Long Term goal Recommender Systems (LTRS), after locating a learner in the course graph, it utilizes a Depth-first search (DFS) algorithm to find all possible paths for a learner given a time restriction. RUTICO also estimates learning time and score for the paths and finally, it recommends a path with the maximum score that satisfies the learner time restriction. In order to evaluate the ability of RUTICO in estimating time and score for paths, we used the Mean Absolute Error and Error. Our results show that we are able to generate a learning path that maximizes a learner's score under a time restriction.