K-means Algorithm Based on Improved Density Peak Algorithm
Abstract：The initial clustering centers and the number Of clusters need to be selected manually in traditional K—means al— gorithm，SO the result of clustering is unstable and easy to fall into local optimal solution．To deal with this problem，this paper proposes a K—means algorithm based on the improved algorithm of density peak(DPC)．The proposed algorithm firstly uses the improved DPC algorithm to select the initial clustering center，SO as to make up for the flaw that the random selection of initial elustering center of[k-means]algorithm leads to the easily trapped local optimal solution，and then uses the K-means algorithm to itcrate and introduce the entropy method to calculate the distance to optimize clustering．The result of experiment on the UCI dataset shows that the proposed algorithm can obtain relatively better initial clustering centers and relatively more stable clustering results，with a faster convergence，thus proving the feasibility of the algorithm．
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
An Improved Probability Propagation Algorithm for Density Peak Clustering Based on Natural Nearest Neighborhood
Clustering by fast search and find of density peaks (DPC) (Since, 2014) has been proven to be a promising clustering approach that efficiently discovers the centers of clusters by finding the density peaks. The accuracy …
ClusteringNonparametric ClusteringImproved Soft-k-Means Clustering Algorithm for Balancing Energy Consumption in Wireless Sensor Networks
Energy load balancing is an essential issue in designing wireless sensor networks (WSNs). Clustering techniques are utilized as energy-efficient methods to balance the network energy and prolong its lifetime. In this pap…
ClusteringDensity EstimationImprovement of K Mean Clustering Algorithm Based on Density
The purpose of this paper is to improve the traditional K-means algorithm. In the traditional K mean clustering algorithm, the initial clustering centers are generated randomly in the data set. It is easy to fall into th…
ClusteringA novel density peaks clustering algorithm based on K nearest neighbors with adaptive merging strategy
Recently the density peaks clustering algorithm (DPC) has received a lot of attention from researchers. The DPC algorithm is able to find cluster centers and complete clustering tasks quickly. It is also suitable for di…
ClusteringEnabling clustering algorithms to detect clusters of varying densities through scale-invariant data preprocessing
In this paper, we show that preprocessing data using a variant of rank transformation called 'Average Rank over an Ensemble of Sub-samples (ARES)' makes clustering algorithms robust to data representation and enable them…
Clustering