K-means text clustering algorithm based on initial cluster centers selection according to maximum distance.

分享到

【作者】ZHAI Dong-hai，YU Jiang，GAO Fei，YU Lei，DING Feng
【DOI】10.3969/j.issn.1001-3695.2014.03.017
【作者单位】1 School of Information Science & Technology, Southwest Jiaotong University, Chengdu 610031, China 2 Engineering School, Tibet University, Lhasa 850000, China
【年份】2014
【卷号】Vol.31 No.3
【页码】713-719
【关键词】K-means clustering RANDOM data COMPUTER algorithms ITERATIVE methods SET theory SAMPLING TEXT processing
【摘要】 Due to the random selection of initial cluster centers, K-means clustering algorithm is prone to local optimal and instability of clustering results, and huge number of iterations. To overcome the above problems, this paper selected the initial clust...
【文献类型】期刊

相关文献

相同作者的文献

相同单位的文献

看了本文的还看了

引证的期刊论文等列表

共8条记录 1/1 第一页 [1] 下一页最后一页到第页