An Improved Density Peaks Method for Data Clustering
Clustering is a powerful approach for data analysis and its aim is to group objects based on their similarities. Density peaks clustering is a recently introduced clustering method with the advantages of doesn't need any predefined parameters and neither any iterative process. In this paper, a novel density peaks clustering method called IDPC is proposed. The proposed method consists of two major steps. In the first step, local density concept is used to identify cluster centers. In the second step, a novel label propagation method is proposed to form clusters. The proposed label propagation method also uses the local density concept in its process to propagate the cluster labels around the whole data points. The effectiveness of the proposed method has been assessed on a synthetic datasets and also on some real-world datasets. The obtained results show that the proposed method outperformed the other state-of-the art methods.
Code (1)
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 ClusteringA density peaks clustering algorithm with sparse search and K-d tree
Density peaks clustering has become a nova of clustering algorithm because of its simplicity and practicality. However, there is one main drawback: it is time-consuming due to its high computational complexity. Herein, a…
2kClusteringLGBQPC: Local Granular-Ball Quality Peaks Clustering
The density peaks clustering (DPC) algorithm has attracted considerable attention for its ability to detect arbitrarily shaped clusters based on a simple yet effective assumption. Recent advancements integrating granular…
ClusteringComputational EfficiencyDensity EstimationAutomatic topography of high-dimensional data sets by non-parametric Density Peak clustering
Data analysis in high-dimensional spaces aims at obtaining a synthetic description of a data set, revealing its main structure and its salient features. We here introduce an approach providing this description in the for…
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…
Clustering