%0 Journal Article
%T Effective method for cluster centers'' initialization in K-means clustering<br>一种有效的K-means聚类中心初始化方法*
%A XIONG Zhong-yang
%A CHEN Ruo-tian
%A ZHANG Yu-fang
%A <br>熊忠阳
%A 陈若田
%A 张玉芳
%J 计算机应用研究
%D 2011
%I 
%X Initializing cluster centers randomly, traditional K-means algorithm leads to great fluctuations in the clustering results. The existing max-min distance algorithm, indeed, has rather dense cluster centers, which may easily bring about clustering conflicts. To solve these problems, this paper regarded the existing max-min distance algorithm as the thinking foundation and proposed the maximum distances product algorithm. Based on the theory of density-based clustering, the maximum distances product algorithm selected each point which had maximum product of distances between itself and all other initialized clustering centers. Theory analysis and experimental results show that compared with traditional K-means algorithm and max-min distance algorithm, the maximum distances product algorithm can result in faster convergence speed, higher accuracy, greater stability.
%K K-means algorithm
%K density-based clustering
%K initial clustering centers
%K max-min distance
%K maximum distances product<br>K-均值算法
%K 基于密度
%K 初始聚类中心
%K 最大最小距离
%K 最大距离积
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=1F8EB868F38CE072B5F3D6BACD791B9C&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=708DD6B15D2464E8&sid=33EE5BF6C313E0C9&eid=87E7DF87668C542A&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9