In 2014, a novel clustering algorithm called Density Peak Clustering (DPC) was proposed in
journal Science, which has received great attention in many fields due to its simplicity and …

An effective density clustering algorithm, called Clustering by Fast Search and Find of
Density Peaks (CFSFDP), is appeared on science in 2014, which is simple and efficient and …

Clustering by fast search and find of density peaks (DP) is a method in which density peaks
are used to select the number of cluster centers. The DP has two input parameters: 1) the …

Fast and efficient are common requirements for all clustering algorithms. Density peaks
clustering algorithm (DPC) can deal with non-spherical clusters well. However, due to the …

Concerning the problem that the cutoff distance needs to be selected manually in Clustering
by Fast Search and Find of Density Peaks (CFSFDP) algorithm, as well as the poor …

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 …

In [1], a clustering algorithm was given to find the centers of clusters quickly. However, the
accuracy of this algorithm heavily depend on the threshold value of dc. Furthermore,[1] has …

Recently a density peaks based clustering algorithm (dubbed as DPC) was proposed to
group data by setting up a decision graph and finding out cluster centers from the graph fast …

Abstract The Density Peaks Clustering (DPC) algorithm is simple and efficient, but still has a
few limitations. For example, DPC needs manual selection of clustering centers and may …