Abstract
Abstract
The calculation method of density has an important influence on the clustering performance of density peak clustering method (DPC), the different density calculation methods are applied for the different datasets. To solve this problem, a self-representation weighted density peak clustering method (SR-DPC) is proposed in this study. Different from DPC, SR-DPC not only considers the local information of data points, but also enhances the influence of different data points on the data center by introducing the idea of weighting, so as to improve the accuracy of finding the data center.Furthermore, SR-DPC can adaptively reflect the influence of different data points on the data center points through the feature representation among data points, and the weighted Gaussian kernel distance is adopted to replace the Euclidean distance, so as to improve its clustering performance. Experimental results based on synthetic datasets and real datasets show that SR-DPC method is effective and practical.
Publisher
Research Square Platform LLC
Reference32 articles.
1. Study on density peaks clustering based on k-nearest neighbors and principal component analysis[J];Du M;Knowledge-Based Systems,2016
2. An entropy-based density peaks clustering algorithm for mixed type data employing fuzzy neighborhood[J];Ding S;Knowledge-Based Systems,2017
3. Bian, Z., Chung, F., & Wang, S. (2020). Fuzzy Density Peaks Clustering, in IEEE Transactions on Fuzzy Systems, on available, 10.1109/TFUZZ.2020.2985004.
4. New Development of Clustering in Data Mining [J];Li M;Computer Application Research
5. Yang, Y., Wang, Y., & Wei, Y. (2019). Adaptive Density Peak Clustering for Determinging Cluster Center, 2019 15th International Conference on Computational Intelligence and Security (CIS), pp. 182–186, 10.1109/CIS.2019.00046.