Density peaks (DP) clustering is a new density-based clustering method. This algorithm can deal with some data sets having non-convex clusters. However, when the shape of clusters is very complicated, it cannot find the optimal structure of clusters. In other words, it cannot discover arbitrary shaped clusters. In order to solve this problem, a new hybrid clustering method, called L-DP, is proposed in this paper combines density peaks clustering with the leader clustering method. Experiments on synthetic datasets show L-DP could be a suitable one for arbitrary shaped clusters compared with the original DP clustering method. The experimental results on real-world data sets demonstrate that the proposed algorithm is competitive with the state-of-the-art clustering algorithms, such as DP, AP and DBSCAN.
CITATION STYLE
Du, M., & Ding, S. (2017). L-DP: A hybrid density peaks clustering method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10387 LNCS, pp. 74–80). Springer Verlag. https://doi.org/10.1007/978-3-319-61845-6_8
Mendeley helps you to discover research relevant for your work.