Liu TLi HZhao XLiang Q2024-10-082024-10-082019-01-01Liu T, Li H, Zhao X. (2019). Clustering by Search in Descending Order and Automatic Find of Density Peaks. IEEE Access. 7. (pp. 133772-133780).https://mro.massey.ac.nz/handle/10179/71631Clustering by fast search and find of density peaks published on journal Science in 2014 is a density-based clustering technique, which is not only unnecessary to determine the number of clusters in advance, but also able to recognize the clusters of arbitrary shapes. Due to a manual selection of clustering centers on a decision graph, samples which belong to one cluster may be assigned to two or more clusters and vice versa. On assumption that boundary points which keep comparable densities with cluster centers should be regarded as inner points, we make a new method which not only can find all possible clusters automatically but also can combine those with similarities simultaneously to obtain the final clusters. Unlike clustering by fast search and find of density peaks, we only focus on densities with discarding the relative metric which measures the minimum distance between a cluster center and a point with a higher density. Qualitative and quantitative experimental results on sufficient datasets demonstrate the effectiveness of our method.(c) 2019 The Author/sCC BY 4.0https://creativecommons.org/licenses/by/4.0/Density-based clusteringdensity peaks clusteringautomatic clusteringdensity categorizationcluster mergingJournal article10.1109/ACCESS.2019.29394372169-3536journal-article133772-133780