A Fuzzy Density Peak Optimization Initial Centers Selection for K-medoids Clustering Algorithm
Cangsheng Liu, Xinran He, Qinglin Xu
Abstract
Open-access reader
Cangsheng Liu, Xinran He, Qinglin Xu
Abstract
Open-access reader
In order to solve the problem that the traditional K-medoids clustering algorithm needs to specify the number of clusters, which is sensitive to the initial cluster center and the slowconvergence speed, the method of density peak optimization is used for solution. In this paper, we propose Fuzzy density peak K-medoids (FDP_K-mediods) algorithm. In the improved K-medoids algorithm, the local clustering center is obtained by calculating the local density and the high density distance, and then merged into the global clustering center, which canadaptively generate the initial clustering center and determine the number of clusters. The experimental results show that our scheme can adaptively generate the initial clustering center and determine the number of clusters with some practical and artificial data sets. Compared with the traditional K-medoids algorithm, the improved algorithm can accurately obtain the numberof clusters and improve the algorithm’s performance
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to solve the problem that the traditional K-medoids clustering algorithm needs to specify the number of clusters, which is sensitive to the initial cluster center and the slowconvergence speed, the method of density peak optimization is used for solution. In this paper, we propose Fuzzy density peak K-medoids (FDP_K-mediods) algorithm. In the improved K-medoids algorithm, the local clustering center is obtained by calculating the local density and the high density distance, and then merged into the global clustering center, which canadaptively generate the initial clustering center and determine the number of clusters. The experimental results show that our scheme can adaptively generate the initial clustering center and determine the number of clusters with some practical and artificial data sets. Compared with the traditional K-medoids algorithm, the improved algorithm can accurately obtain the numberof clusters and improve the algorithm’s performance
Key concepts: k-medoids, Cluster analysis, Medoid, CURE data clustering algorithm, Fuzzy clustering, Correlation clustering, k-medians clustering, Algorithm