Adaptive Learning Objects Assembly with compound constraints

Shanshan Wan, Zhendong Niu
{"title":"Adaptive Learning Objects Assembly with compound constraints","authors":"Shanshan Wan, Zhendong Niu","doi":"10.1109/ComComAp.2014.7017166","DOIUrl":null,"url":null,"abstract":"This article addresses how to fulfill ALOA (Adaptive Learning Objects Assembly) which provides users personalized learning resources and learning path based on evolutionary PBIL (Population Based Incremental Learning) algorithm. Both the users' preferences and learning resources' intrinsic characteristics are considered here. And the experience from proficient experts is used to give the LO (Learning Object) difficulty level and important grade which guides the LO's sequencing and selection. The constraints of knowledge such as basic ones, itinerary ones and compulsory ones are also vital factors for ALOA. All of above are modeled as a Constraint Satisfaction Problem (CSP). The PBIL algorithm is proposed and applied to ALOA firstly. The hybrid intelligent evolutionary algorithm is tested on true teaching data and the participants also give the learning feeling. We also obtained the experiment data from the tested data and questionnaire. ALOA's good validity, accuracy, and stability performance are verified.","PeriodicalId":422906,"journal":{"name":"2014 IEEE Computers, Communications and IT Applications Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Computers, Communications and IT Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ComComAp.2014.7017166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This article addresses how to fulfill ALOA (Adaptive Learning Objects Assembly) which provides users personalized learning resources and learning path based on evolutionary PBIL (Population Based Incremental Learning) algorithm. Both the users' preferences and learning resources' intrinsic characteristics are considered here. And the experience from proficient experts is used to give the LO (Learning Object) difficulty level and important grade which guides the LO's sequencing and selection. The constraints of knowledge such as basic ones, itinerary ones and compulsory ones are also vital factors for ALOA. All of above are modeled as a Constraint Satisfaction Problem (CSP). The PBIL algorithm is proposed and applied to ALOA firstly. The hybrid intelligent evolutionary algorithm is tested on true teaching data and the participants also give the learning feeling. We also obtained the experiment data from the tested data and questionnaire. ALOA's good validity, accuracy, and stability performance are verified.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有复合约束的自适应学习对象组装
本文讨论了如何实现ALOA (Adaptive Learning Objects Assembly), ALOA是一种基于进化PBIL (Population based Incremental Learning)算法为用户提供个性化学习资源和学习路径的方法。这里既考虑了用户的偏好,也考虑了学习资源的内在特征。并利用专家的经验给出学习对象的难度等级和重要等级,指导学习对象的排序和选择。基础知识约束、行程知识约束、义务知识约束等也是影响ALOA的重要因素。所有这些都被建模为约束满足问题(CSP)。首先提出了PBIL算法,并将其应用于ALOA。混合智能进化算法在真实的教学数据上进行了测试,参与者也给出了学习的感觉。我们还从测试数据和问卷中获得了实验数据。验证了ALOA具有良好的效度、准确性和稳定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast acquisition method of navigation receiver based on folded PMF-FFT Web service sub-chain recommendation leveraging graph searching Path prediction based on second-order Markov chain for the opportunistic networks A novel UEP resource allocation scheme for layered source transmission in COFDM systems Energy efficient scheduling with probability and task migration considerations for soft real-time systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1