首页> 外文会议>International Conference on Computer Science and Educational Informatization >MSK: A Grade Mining Method for Second-Class Based on MeanShift and K-means
【24h】

MSK: A Grade Mining Method for Second-Class Based on MeanShift and K-means

机译:MSK:基于VINSSHIFT和K-MEAL的二等级别的级挖掘方法

获取原文

摘要

With the advent of the era of big data, more and more data are accumulated by the second class in colleges and universities, and how to effectively analyze and use them has become the research focus. A novel clustering algorithm named MeanShift-K-means (MSK) is proposed to assess the scores and get the relationship between scores and graduation. Firstly, the MeanShift vector is calculated by Gaussian kernel function, Then MeanShift algorithm is used to obtain the initial clustering center points in K-Means, instead of random selection. Secondly, the improved K-means algorithm was applied to assess the second class in a university. The results show that the MSK algorithm has better clustering effect than the traditional Kmeans algorithm and Canopy-K-means algorithm, which is more helpful to recommend activities for college students and to provide predictive guidance and decision-making basis for administrators.
机译:随着大数据时代的出现,高校第二课程越来越多的数据,以及如何有效分析和使用它们已成为研究重点。 提出了一种名为含意大式大气(MSK)的新型聚类算法来评估分数并获得分数与毕业之间的关系。 首先,通过高斯内核函数计算意大式置信矢量,然后使用意大式算法用于在K-means中获得初始聚类中心点,而不是随机选择。 其次,应用改进的K-Means算法用于评估大学的第二类。 结果表明,MSK算法具有比传统的邮件算法和Canopy-K-Means算法更好的聚类效果,这更有助于为大学生推荐活动,并为管理人员提供预测的指导和决策基础。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号