An Efficient Clustering Algorithm Suitable for Mass Date Mining

摘要：

The efficiency and fast of data mining algorithms is strongly needed with data becoming larger and larger. In the current clustering algorithms,has not yet applied to the massive data mining clustering algorithm.In this paper,the classic clustering algorithm kmeans researched,use the ideological of division and distribution,a new highly efficient clustering algorithm that is named d-kmeans(distributed kmeans)clustering algorithm is presented.In M-handling process reduce the time complexity nearly about the original 1/M.theoreticaI and experimental results show that the algorithm suitable for mass data mining

关键词： Kmeans clusters d-kmeans distributed

作者: Yulong Xu Jinrui Chen Hong Zhou Dawei Xiao

会议类型: 国际会议

会议名称: The International Conference Information Computing and Automation(2007国际信息计算与自动化会议)

会议地点: 成都

会议语种:英文

页码: 721-723

在线出版日期: 2007-12-19（万方平台首次上网日期，不代表论文的发表时间）