一种在线学习平台的无监督技能聚类

Afaf Ahmed, I. Zualkernan, H. Elghazaly
{"title":"一种在线学习平台的无监督技能聚类","authors":"Afaf Ahmed, I. Zualkernan, H. Elghazaly","doi":"10.1109/ICALT52272.2021.00066","DOIUrl":null,"url":null,"abstract":"Online learning platforms are generating an enormous amount of data that lends itself to unsupervised learning. This paper presents a case study where assessment data from two online platforms was used to cluster students into similar groups. The long-term objective of this research is to incorporate the clustering information into the personalization mechanisms. K-means was used to cluster students for 10 Skills. K-means was able to create a small number of clusters with reasonable internal validity with an average silhouette width of 0.32 (sd=0.05). The clusters were non-trivial as gender, school or class could not explain the clustering with an average Adjusted Rand Index (ARI) of 0.049 (sd=0.03). Most importantly, only a small subset (18%) of attempted questions could be used to explain accurately (Average F1-measure = 89.43) why the students were grouped into clusters. These keystone questions can be used to further enhance the personalization mechanisms.","PeriodicalId":170895,"journal":{"name":"2021 International Conference on Advanced Learning Technologies (ICALT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Unsupervised Clustering of Skills for an Online Learning Platform\",\"authors\":\"Afaf Ahmed, I. Zualkernan, H. Elghazaly\",\"doi\":\"10.1109/ICALT52272.2021.00066\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online learning platforms are generating an enormous amount of data that lends itself to unsupervised learning. This paper presents a case study where assessment data from two online platforms was used to cluster students into similar groups. The long-term objective of this research is to incorporate the clustering information into the personalization mechanisms. K-means was used to cluster students for 10 Skills. K-means was able to create a small number of clusters with reasonable internal validity with an average silhouette width of 0.32 (sd=0.05). The clusters were non-trivial as gender, school or class could not explain the clustering with an average Adjusted Rand Index (ARI) of 0.049 (sd=0.03). Most importantly, only a small subset (18%) of attempted questions could be used to explain accurately (Average F1-measure = 89.43) why the students were grouped into clusters. These keystone questions can be used to further enhance the personalization mechanisms.\",\"PeriodicalId\":170895,\"journal\":{\"name\":\"2021 International Conference on Advanced Learning Technologies (ICALT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Advanced Learning Technologies (ICALT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICALT52272.2021.00066\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Advanced Learning Technologies (ICALT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICALT52272.2021.00066","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在线学习平台正在产生大量的数据,这些数据有利于无监督学习。本文提出了一个案例研究,其中使用来自两个在线平台的评估数据将学生分成相似的组。本研究的长期目标是将聚类信息整合到个性化机制中。使用K-means对学生的10项技能进行聚类。K-means能够创建少量具有合理内部效度的聚类,平均轮廓宽度为0.32 (sd=0.05)。由于性别、学校或班级不能解释聚类,平均调整后兰德指数(ARI)为0.049 (sd=0.03),聚类是非平凡的。最重要的是,只有一小部分(18%)的尝试问题可以用来准确地解释为什么学生被分成集群(平均f1测量值= 89.43)。这些关键问题可以用来进一步完善个性化机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Unsupervised Clustering of Skills for an Online Learning Platform
Online learning platforms are generating an enormous amount of data that lends itself to unsupervised learning. This paper presents a case study where assessment data from two online platforms was used to cluster students into similar groups. The long-term objective of this research is to incorporate the clustering information into the personalization mechanisms. K-means was used to cluster students for 10 Skills. K-means was able to create a small number of clusters with reasonable internal validity with an average silhouette width of 0.32 (sd=0.05). The clusters were non-trivial as gender, school or class could not explain the clustering with an average Adjusted Rand Index (ARI) of 0.049 (sd=0.03). Most importantly, only a small subset (18%) of attempted questions could be used to explain accurately (Average F1-measure = 89.43) why the students were grouped into clusters. These keystone questions can be used to further enhance the personalization mechanisms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Micro-Prompt: A Strategy for Designing Pedagogically Effective Assignment Free Micro-Lectures for Online Education Systems An Exploratory Study to Identify Learners' Programming Behavior Interactions Automatic and Intelligent Recommendations to Support Students’ Self-Regulation VEA: A Virtual Environment for Animal experimentation Teachers’ Information and Communication Technology (ICT) Assessment Tools: A Review
×
引用
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