期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
An Improved K-Means Algorithm Based on Initial Clustering Center Optimization
1
作者 LI Taihao NAREN Tuya +2 位作者 ZHOU Jianshe REN Fuji LIU Shupeng 《ZTE Communications》 2017年第B12期43-46,共4页
The K-means algorithm is widely known for its simplicity and fastness in text clustering.However,the selection of the initial clus?tering center with the traditional K-means algorithm is some random,and therefore,the ... The K-means algorithm is widely known for its simplicity and fastness in text clustering.However,the selection of the initial clus?tering center with the traditional K-means algorithm is some random,and therefore,the fluctuations and instability of the clustering results are strongly affected by the initial clustering center.This paper proposed an algorithm to select the initial clustering center to eliminate the uncertainty of central point selection.The experiment results show that the improved K-means clustering algorithm is superior to the traditional algorithm. 展开更多
关键词 clustering K-means algorithm initial clustering center
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部