摘要
聚类是数据挖掘领域最重要的技术之一,K-means是其中使用频率最高的举足轻重的聚类算法。然而,Kmeans算法表现严重依赖于初始中心,选取多少个初始中心以及选择哪些数据点作为初始中心对K-means算法十分重要。基于此,提出一种初始中心选取方法 DPCC(Density Peak Clustering Centers)。DPCC方法基于密度和距离生成一个选取决策图,将数据集中所有的密度峰值点凸显出来。这些密度峰值点即为DPCC方法为K-means算法提供的初始中心。实验表明,DPCC方法不仅可为K-means提供初始中心数量,还能有效提高K-means算法的准确度,并缩减K-means算法的执行时间。
Clustering is one of the most important data mining technologies, and K-means is the most famous and commonly used clustering algorithm. However, the performance of K-means depends heavily on the initial centers. It is very important for Kmeans to select how many initial centers and which data points to choose as the initial centers. Therefore, an initial centers selection method called DPCC(density peak clustering centers) is proposed. DPCC generates a selection decision graph based on density and distance, so as to highlight all density peak points in dataset. These density peak points are the initial centers provided by DPCC for K-means. Experiments show that DPCC not only provides decision support for the number of initial centers, but also improves the accuracy of K-means and reduces the running time of K-means.
作者
李秋云
刘燕武
Li Qiuyun;Liu Yanwu(Beijing Institute of Astronautical Systems Engineering,China Academy of Launch Vehicle Technology,Beijing 100076,China;China Electronics Corporation,Shenzhen 518000,China)
出处
《电子技术应用》
2023年第3期134-138,共5页
Application of Electronic Technique
关键词
聚类
初始中心
决策图
clustering
initial centers
decision graph