文章詳目資料

Journal of Computers EIMEDLINEScopus

  • 加入收藏
  • 下載文章
篇名 Clustering of College Students Based on Improved K-means Algorithm
卷期 28:6
作者 Zhongxiang Fan 、 Yan Sun 、 Hong Luo
頁次 195-203
關鍵字 college student 、 initial cluster centers 、 K-means 、 density 、 outlier 、 EI 、 MEDLINE 、 Scopus
出刊日期 201712
DOI 10.3966/199115992017122806017

中文摘要

英文摘要

Many colleges have accumulated a large amount of information, such as achievement data and consumption records. According to the above information, we attempt to identify the student group from various aspects. Based on this, we can acquire the characteristics of students in different groups, then get the relationship between students’ different behaviors by association rules mining method. In this way, the college can have a better understanding of students to accomplish the reasonable management. In order to obtain more accurate cluster results, we proposed an improved K-means algorithm. Specially, we effectively detect outliers based on the grid density. In addition, we design a new method to produce initial cluster centers which replaces the traditional random way. Real experiments are conducted and the results show the iteration time is reduced and clustering precision is improved.

本卷期文章目次

查看更多

關鍵知識WIKI

查看更多

相關文獻