基于知识图和改进蚁群优化算法的多粒度学习路径推荐框架

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Yaqian Zheng;Deliang Wang;Yaping Xu;Yanyan Li
{"title":"基于知识图和改进蚁群优化算法的多粒度学习路径推荐框架","authors":"Yaqian Zheng;Deliang Wang;Yaping Xu;Yanyan Li","doi":"10.1109/TCSS.2024.3488373","DOIUrl":null,"url":null,"abstract":"In e-learning, extracting suitable learning objects (LOs) from a vast resource pool and organizing them into high-quality learning paths is crucial for helping e-learners achieve their goals. Numerous approaches have been proposed to recommend optimal learning paths for e-learners. However, it is essential to emphasize that e-learning systems typically consist of a wide range of LOs with varying levels of granularity, ranging from fine-grained to coarse-grained. Unfortunately, current research has not adequately considered the underlying granularity structure of LOs when optimizing learning paths. Existing methods primarily focus on organizing LOs at a single granularity level, limiting their applicability in real-world e-learning systems. To address the limitations, we propose a multigranularity learning path recommendation (MGLPR) framework that aims to flexibly and effectively integrate the diverse granularity levels of LOs into high-quality learning paths. In this framework, a two-layer [knowledge point (KP) and LO layers] model is developed to formulate the MGLPR problem as a constrained optimization problem and an improved ant colony optimization algorithm (IACO) is introduced to solve it to identify optimal learning paths for e-learners. To evaluate the effectiveness of the proposed IACO, we conducted extensive computational experiments using 30 simulation datasets with varying problem sizes and complexities. The results demonstrate that our proposed IACO achieves superior performance and robustness compared with other competitors. Additionally, an empirical study was conducted to investigate the efficacy of the proposed approach in an authentic learning context, with results indicating that the proposed method outperforms the traditional self-organized ones.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"12 2","pages":"586-607"},"PeriodicalIF":4.5000,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Multigranularity Learning Path Recommendation Framework Based on Knowledge Graph and Improved Ant Colony Optimization Algorithm for E-Learning\",\"authors\":\"Yaqian Zheng;Deliang Wang;Yaping Xu;Yanyan Li\",\"doi\":\"10.1109/TCSS.2024.3488373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In e-learning, extracting suitable learning objects (LOs) from a vast resource pool and organizing them into high-quality learning paths is crucial for helping e-learners achieve their goals. Numerous approaches have been proposed to recommend optimal learning paths for e-learners. However, it is essential to emphasize that e-learning systems typically consist of a wide range of LOs with varying levels of granularity, ranging from fine-grained to coarse-grained. Unfortunately, current research has not adequately considered the underlying granularity structure of LOs when optimizing learning paths. Existing methods primarily focus on organizing LOs at a single granularity level, limiting their applicability in real-world e-learning systems. To address the limitations, we propose a multigranularity learning path recommendation (MGLPR) framework that aims to flexibly and effectively integrate the diverse granularity levels of LOs into high-quality learning paths. In this framework, a two-layer [knowledge point (KP) and LO layers] model is developed to formulate the MGLPR problem as a constrained optimization problem and an improved ant colony optimization algorithm (IACO) is introduced to solve it to identify optimal learning paths for e-learners. To evaluate the effectiveness of the proposed IACO, we conducted extensive computational experiments using 30 simulation datasets with varying problem sizes and complexities. The results demonstrate that our proposed IACO achieves superior performance and robustness compared with other competitors. Additionally, an empirical study was conducted to investigate the efficacy of the proposed approach in an authentic learning context, with results indicating that the proposed method outperforms the traditional self-organized ones.\",\"PeriodicalId\":13044,\"journal\":{\"name\":\"IEEE Transactions on Computational Social Systems\",\"volume\":\"12 2\",\"pages\":\"586-607\"},\"PeriodicalIF\":4.5000,\"publicationDate\":\"2024-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Computational Social Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10750152/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10750152/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

摘要

在电子学习中,从庞大的资源池中提取合适的学习对象(LOs)并将其组织成高质量的学习路径对于帮助电子学习者实现目标至关重要。已经提出了许多方法来推荐电子学习者的最佳学习路径。然而,必须强调的是,电子学习系统通常由各种粒度级别的LOs组成,范围从细粒度到粗粒度。不幸的是,目前的研究在优化学习路径时没有充分考虑LOs的底层粒度结构。现有的方法主要侧重于在单个粒度级别组织lo,限制了它们在实际电子学习系统中的适用性。为了解决这些限制,我们提出了一个多粒度学习路径推荐(MGLPR)框架,旨在灵活有效地将不同粒度级别的LOs集成到高质量的学习路径中。在该框架中,建立了一个两层[知识点(KP)和LO层]模型,将MGLPR问题描述为一个约束优化问题,并引入改进的蚁群优化算法(IACO)来解决该问题,以识别电子学习者的最优学习路径。为了评估所提出的IACO的有效性,我们使用30个具有不同问题规模和复杂性的模拟数据集进行了广泛的计算实验。结果表明,与其他竞争对手相比,我们提出的IACO具有更好的性能和鲁棒性。此外,本文还对该方法在真实学习情境中的有效性进行了实证研究,结果表明该方法优于传统的自组织学习方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Multigranularity Learning Path Recommendation Framework Based on Knowledge Graph and Improved Ant Colony Optimization Algorithm for E-Learning
In e-learning, extracting suitable learning objects (LOs) from a vast resource pool and organizing them into high-quality learning paths is crucial for helping e-learners achieve their goals. Numerous approaches have been proposed to recommend optimal learning paths for e-learners. However, it is essential to emphasize that e-learning systems typically consist of a wide range of LOs with varying levels of granularity, ranging from fine-grained to coarse-grained. Unfortunately, current research has not adequately considered the underlying granularity structure of LOs when optimizing learning paths. Existing methods primarily focus on organizing LOs at a single granularity level, limiting their applicability in real-world e-learning systems. To address the limitations, we propose a multigranularity learning path recommendation (MGLPR) framework that aims to flexibly and effectively integrate the diverse granularity levels of LOs into high-quality learning paths. In this framework, a two-layer [knowledge point (KP) and LO layers] model is developed to formulate the MGLPR problem as a constrained optimization problem and an improved ant colony optimization algorithm (IACO) is introduced to solve it to identify optimal learning paths for e-learners. To evaluate the effectiveness of the proposed IACO, we conducted extensive computational experiments using 30 simulation datasets with varying problem sizes and complexities. The results demonstrate that our proposed IACO achieves superior performance and robustness compared with other competitors. Additionally, an empirical study was conducted to investigate the efficacy of the proposed approach in an authentic learning context, with results indicating that the proposed method outperforms the traditional self-organized ones.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信