Affiliation:
1. Guangxi Minzu University
Abstract
AbstractDensity Peaks Clustering (DPC) algorithm is a new algorithm based on density clustering analysis, which can quickly obtain the cluster centers by drawing the decision diagram by using the calculation of local density and relative distance. Without prior knowledge and iteration, the parameters and structure are simple and easy to implement. Since it was proposed in 2014, it has attracted a large number of researchers to explore experiments and improve applications in recent years. In this paper, we first analyze the theory of DPC and its performance advantages and disadvantages. Secondly, it summarizes the improvement of DPC in recent years, analyzes the improvement effect, and shows it with experimental data. Finally, the related application research of DPC in different fields is introduced. At the same time, we summarize and prospect the improvement and development of DPC.
Publisher
Research Square Platform LLC
Reference101 articles.
1. Adaptive latent similarity learning for multi-view clustering;Xie DY;Neural Netw,2020
2. Tsakiris M, Vidal R (2018) Theoretical analysis of sparse subspace clustering with missing entries. In: Proc. of the 35th Int’l Conf. on Machine Learning. Stockholm: PMLR, 4975 – 4984
3. Big data: The revolution is digitized [J];Seife CJN,2015
4. k-Means: A revisit;Zhao WL;Neurocomputing,2018
5. Chameleon: Survey-free updating of a fingerprint database for indoor localization;He S;IEEE Pervasive Comput,2016