Affiliation:
1. Faculty of Information Technology, Beljing University of Technology, Beijing 100124, China
Abstract
In the era of big data, unsupervised learning algorithms such as clustering are particularly prominent. In recent years, there have been significant advancements in clustering algorithm research. The Clustering by Density Peaks algorithm is known as Clustering by Fast Search and Find of Density Peaks (density peak clustering). This clustering algorithm, proposed in Science in 2014, automatically finds cluster centers. It is simple, efficient, does not require iterative computation, and is suitable for large-scale and high-dimensional data. However, DPC and most of its refinements have several drawbacks. The method primarily considers the overall structure of the data, often resulting in the oversight of many clusters. The choice of truncation distance affects the calculation of local density values, and varying dataset sizes may necessitate different computational methods, impacting the quality of clustering results. In addition, the initial assignment of labels can cause a ‘chain reaction’, i.e., if one data point is incorrectly labeled, it may lead to more subsequent data points being incorrectly labeled. In this paper, we propose an improved density peak clustering method, DPC-MS, which uses the mean-shift algorithm to find local density extremes, making the accuracy of the algorithm independent of the parameter dc. After finding the local density extreme points, the allocation strategy of the DPC algorithm is employed to assign the remaining points to appropriate local density extreme points, forming the final clusters. The robustness of this method in handling uncertain dataset sizes adds some application value, and several experiments were conducted on synthetic and real datasets to evaluate the performance of the proposed method. The results show that the proposed method outperforms some of the more recent methods in most cases.
Reference23 articles.
1. A density-based algorithm for discovering clusters in large spatial databases with noise;Ester;kdd,1996
2. Chen, T.Q., Murphey, Y.L., Karlsen, R., and Gerhart, G. (2003, January 23–26). Color Image Segmentation in Color and Spatial Domain. Proceedings of the Developments in Applied Artificial Intelligence: 16th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2003, Loughborough, UK.
3. A link density clustering algorithm based on automatically selecting density peaks for overlapping community detection;Huang;Int. J. Mod. Phys. B,2016
4. Clustering by fast search and find of density peaks via heat diffusion;Mehmood;Neurocomputing,2016
5. Saini, A., Saraswat, S., and Faujdar, N. (2017). Clustering Based Stock Market Analysis. Int. J. Control. Theory Appl., 10.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献