Improved clustering and association rules mining for university student course scores

Tian Zhang, Changchuan Yin, Lin Pan
{"title":"Improved clustering and association rules mining for university student course scores","authors":"Tian Zhang, Changchuan Yin, Lin Pan","doi":"10.1109/ISKE.2017.8258808","DOIUrl":null,"url":null,"abstract":"In order to help students improve their performance in college, this paper discovered the association rules among the scores of different courses, and introduced the parameter \"Interest\" to help filtering the rules. In order to meet the demand for score discretization in association rules mining, this paper analyzed score distribution characteristics, and proposed an initial cluster center optimized and isolated point pre-processed K-means clustering algorithm based on sample distribution density. This algorithm can reduce the sensitivity of K-means algorithm to initial cluster centers and isolated points. The numerical results and evaluation index show that this algorithm can meet the requirements of score discretization. The result of association rules mining using this improved K-means algorithm for score discretization can efficiently reduce the invalid and wrong rules.","PeriodicalId":208009,"journal":{"name":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2017.8258808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In order to help students improve their performance in college, this paper discovered the association rules among the scores of different courses, and introduced the parameter "Interest" to help filtering the rules. In order to meet the demand for score discretization in association rules mining, this paper analyzed score distribution characteristics, and proposed an initial cluster center optimized and isolated point pre-processed K-means clustering algorithm based on sample distribution density. This algorithm can reduce the sensitivity of K-means algorithm to initial cluster centers and isolated points. The numerical results and evaluation index show that this algorithm can meet the requirements of score discretization. The result of association rules mining using this improved K-means algorithm for score discretization can efficiently reduce the invalid and wrong rules.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
改进的聚类和关联规则挖掘大学生课程成绩
为了帮助学生提高大学成绩,本文发现了不同课程成绩之间的关联规则,并引入了“兴趣”参数来帮助过滤规则。为了满足关联规则挖掘中分数离散化的需求,分析了分数分布特征,提出了一种基于样本分布密度的初始聚类中心优化和孤立点预处理的K-means聚类算法。该算法可以降低K-means算法对初始聚类中心和孤立点的敏感性。数值结果和评价指标表明,该算法能够满足分数离散化的要求。将改进的K-means算法用于分数离散化的关联规则挖掘结果可以有效地减少无效规则和错误规则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An interval-valued fuzzy soft set based triple I method Knowledge-based innovative methods for collaborative quality control in equipment outsourcing chain SimWalk: Learning network latent representations with social relation similarity An evaluation of sustainable development in less developed areas of Western China A data forwarding algorithm based on estimated Hungarian method for underwater sensor networks
×
引用
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