聚类分析
计算机科学
数据挖掘
确定数据集中的群集数
星团(航天器)
相关聚类
CURE数据聚类算法
单连锁聚类
算法
k-中位数聚类
模糊聚类
高维数据聚类
人工智能
程序设计语言
作者
Wuning Tong,Sen Liu,Xiao‐Zhi Gao
出处
期刊:Neurocomputing
[Elsevier BV]
日期:2020-11-06
卷期号:458: 655-666
被引量:43
标识
DOI:10.1016/j.neucom.2020.03.125
摘要
Clustering is a typical and important method to discover new structures and knowledge from data sets. Most existing clustering methods need to know the number of clusters in advance, which is difficult. Some algorithms claim they do not need to know the number of clusters in advance. Among these algorithms, however, some need to manually determine the cluster centers in a decision graph, which is not easy; some assume that the number of initial cluster centers given is greater than the actual number of classes, but in fact the true number of clusters is not known. In order to tackle this issue, we propose a density-peak-based clustering algorithm of automatically determining the number of clusters. First, we design a density metric by using a continuous function which can well distinguish the densities of different data points. Then, we design a pre-clustering method which can get the initial cluster centers and the corresponding clusters. Furthermore, we propose an automatic clustering method which can automatically determine the final cluster centers and the corresponding clusters. Experiments are conducted on widely used data sets, and the results show the effectiveness of the proposed method.
科研通智能强力驱动
Strongly Powered by AbleSci AI