基于最小不相似度归一化指标的粗糙集处理网络学习者学习模式识别中的不确定性

Vijayan Sugumaran , S. Jafar Ali Ibrahim
{"title":"基于最小不相似度归一化指标的粗糙集处理网络学习者学习模式识别中的不确定性","authors":"Vijayan Sugumaran ,&nbsp;S. Jafar Ali Ibrahim","doi":"10.1016/j.ijin.2022.09.001","DOIUrl":null,"url":null,"abstract":"<div><p>The determination of e-learners' learning style in an online environment has raised the potential scope of interest as its exact estimation prompts a sensational improvement in the contents of the learning framework and student performance. It requires a deep investigation of the learning habits of the learner. Grouping e-learners together provides a more quantifiable way to analyze the learner's feedback and log files to discriminate them based on their learning style. This is accomplished with the help of clustering algorithms in data mining that aids in determining their learning styles well. The target clusters are analyzed by generating functional patterns or rules using the rule induction algorithms. Most of the existing works in the literature attributed to the elucidation of learning styles fail to address the uncertainty and inconsistency in the learner's characteristics. The RST is an optimal method for analyzing the learner's behavior in this context. Thus, a Rough set based least dissimilarity normalized index (RS-LDNI) is proposed for resolving uncertainty while estimating e-learners' learning patterns. This RS-LNDI used the merits of Maximum Dependency Attributes (MDA) for categorical clustering such that the maximal dependency between attributes can be determined by splitting attributes instead of Roughness. It also adopted categorical data clustering to attain the correlation between attributes that cannot be used for learning style prediction. The experimental results of the RS-LNDI algorithm outperform the demerits of these existing clustering algorithms by utilizing the reduct and equivalence class property of rough set theory.</p></div>","PeriodicalId":100702,"journal":{"name":"International Journal of Intelligent Networks","volume":"3 ","pages":"Pages 133-137"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666603022000148/pdfft?md5=de01da26b8655021f70e550c06fc56c9&pid=1-s2.0-S2666603022000148-main.pdf","citationCount":"1","resultStr":"{\"title\":\"Rough set based on least dissimilarity normalized index for handling uncertainty during E-learners learning pattern recognition\",\"authors\":\"Vijayan Sugumaran ,&nbsp;S. Jafar Ali Ibrahim\",\"doi\":\"10.1016/j.ijin.2022.09.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The determination of e-learners' learning style in an online environment has raised the potential scope of interest as its exact estimation prompts a sensational improvement in the contents of the learning framework and student performance. It requires a deep investigation of the learning habits of the learner. Grouping e-learners together provides a more quantifiable way to analyze the learner's feedback and log files to discriminate them based on their learning style. This is accomplished with the help of clustering algorithms in data mining that aids in determining their learning styles well. The target clusters are analyzed by generating functional patterns or rules using the rule induction algorithms. Most of the existing works in the literature attributed to the elucidation of learning styles fail to address the uncertainty and inconsistency in the learner's characteristics. The RST is an optimal method for analyzing the learner's behavior in this context. Thus, a Rough set based least dissimilarity normalized index (RS-LDNI) is proposed for resolving uncertainty while estimating e-learners' learning patterns. This RS-LNDI used the merits of Maximum Dependency Attributes (MDA) for categorical clustering such that the maximal dependency between attributes can be determined by splitting attributes instead of Roughness. It also adopted categorical data clustering to attain the correlation between attributes that cannot be used for learning style prediction. The experimental results of the RS-LNDI algorithm outperform the demerits of these existing clustering algorithms by utilizing the reduct and equivalence class property of rough set theory.</p></div>\",\"PeriodicalId\":100702,\"journal\":{\"name\":\"International Journal of Intelligent Networks\",\"volume\":\"3 \",\"pages\":\"Pages 133-137\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2666603022000148/pdfft?md5=de01da26b8655021f70e550c06fc56c9&pid=1-s2.0-S2666603022000148-main.pdf\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2666603022000148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Networks","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2666603022000148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

对在线环境中电子学习者学习风格的确定已经提高了潜在的研究范围,因为对其进行准确的估计会在学习框架的内容和学生表现方面带来巨大的改善。这需要对学习者的学习习惯进行深入的调查。将电子学习者分组在一起提供了一种更可量化的方法来分析学习者的反馈和日志文件,从而根据他们的学习风格来区分他们。这是在数据挖掘中的聚类算法的帮助下完成的,这有助于很好地确定他们的学习风格。通过使用规则归纳算法生成功能模式或规则来分析目标聚类。现有的关于学习风格的研究大多没有解决学习者特征的不确定性和不一致性。RST是在这种情况下分析学习者行为的最佳方法。因此,提出了一种基于粗糙集的最小不相似度归一化指数(RS-LDNI)来解决在线学习者学习模式估计过程中的不确定性。该RS-LNDI利用最大依赖属性(MDA)的优点进行分类聚类,这样属性之间的最大依赖关系可以通过拆分属性来确定,而不是粗糙度。并采用了分类数据聚类的方法来获得无法用于学习风格预测的属性之间的相关性。实验结果表明,RS-LNDI算法利用粗糙集理论的约简和等价类特性,克服了现有聚类算法的缺点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rough set based on least dissimilarity normalized index for handling uncertainty during E-learners learning pattern recognition

The determination of e-learners' learning style in an online environment has raised the potential scope of interest as its exact estimation prompts a sensational improvement in the contents of the learning framework and student performance. It requires a deep investigation of the learning habits of the learner. Grouping e-learners together provides a more quantifiable way to analyze the learner's feedback and log files to discriminate them based on their learning style. This is accomplished with the help of clustering algorithms in data mining that aids in determining their learning styles well. The target clusters are analyzed by generating functional patterns or rules using the rule induction algorithms. Most of the existing works in the literature attributed to the elucidation of learning styles fail to address the uncertainty and inconsistency in the learner's characteristics. The RST is an optimal method for analyzing the learner's behavior in this context. Thus, a Rough set based least dissimilarity normalized index (RS-LDNI) is proposed for resolving uncertainty while estimating e-learners' learning patterns. This RS-LNDI used the merits of Maximum Dependency Attributes (MDA) for categorical clustering such that the maximal dependency between attributes can be determined by splitting attributes instead of Roughness. It also adopted categorical data clustering to attain the correlation between attributes that cannot be used for learning style prediction. The experimental results of the RS-LNDI algorithm outperform the demerits of these existing clustering algorithms by utilizing the reduct and equivalence class property of rough set theory.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
12.00
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信