计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (27): 159-161.DOI: 10.3778/j.issn.1002-8331.2008.27.051

• 数据库、信号与信息处理 • 上一篇    下一篇

一种基于广度优先搜索的K-means初始化算法

张忠平,王爱杰,陈丽萍   

  1. 燕山大学 信息科学与工程学院,河北 秦皇岛 066004
  • 收稿日期:2007-11-09 修回日期:2008-01-31 出版日期:2008-09-21 发布日期:2008-09-21
  • 通讯作者: 张忠平

Method for initializing K-means clustering algorithm based on breadth first search

ZHANG Zhong-ping,WANG Ai-jie,CHEN Li-ping   

  1. College of Information Science and Engineering,Yanshan University,Qinhuangdao,Hebei 066004,China
  • Received:2007-11-09 Revised:2008-01-31 Online:2008-09-21 Published:2008-09-21
  • Contact: ZHANG Zhong-ping

摘要: K-means算法是在现实应用中非常广泛的聚类算法,K-means算法对初始中心的选择非常敏感,对已存在的有代表性的初始算法进行了研究,提出了一种基于广度优先搜索的K-means初始化算法。该算法综合考虑了密度与距离因素,选择初始点。分析表明该算法选择的初始点非常接近期望的中心点。

Abstract: K-means algorithm is a clustering algorithm used extensively in application.It is very sensitive to initial cluster center.In this paper,the authors compare some classic initialization algorithm and propose a new method for initializing K-means algorithm based on breadth first search.The new method considers both density estimation and distance to select initial cluster center.Analysis shows the cluster centers selected by this method is very close to the desired cluster centers.