Local Peaks-Based Clustering Algorithm in Symmetric Neighborhood Graph

Abstract

Density-based clustering methods have achieved many applications in data mining, whereas most of them still likely suffer poor performances on data sets with extremely uneven distributions, like the manifold or ring data. The paper proposes a novel method for clustering with local peaks in the symmetric neighborhood. Local peaks are points with maximum densities at the local level. During the searching of local peaks, all data, except those outliers, can be easily divided into a number of small clusters in accordance with the local peaks in each point's neighborhood. Especially, a graph-based scheme is adopted here to merge similar clusters based on their similarity in the symmetric neighborhood graph, followed by assigning each outlier to the closest cluster. A variety of artificial, real data sets and a real building data set have been tested for clustering by the proposed method and compared against other popular density-based methods and other algorithms.