Name
Abstract | ||
|---|---|---|
In the clustering algorithms, it is a bottleneck to identify clusters with arbitrarily. In this paper, a new method DAPPFC (density-based affinity propagation for parameter free clustering) is proposed. Firstly, it obtains a group of normalized density from the unsupervised clustering results. Then, the density is used for density clustering for multiple times. Finally, the multiple-density clustering results undergo a two-stage synthesis to achieve the final clustering result. The experiment shows that the proposed method does not require the user’s intervention, and it can also get an accurate clustering result in the presence of arbitrarily shaped clusters with a minimal additional computation cost. |
Year | Venue | Field |
|---|---|---|
2016 | ADMA | Data mining,Bottleneck,Cluster (physics),Normalization (statistics),Affinity propagation,Computer science,Algorithm,Cluster analysis,Computation |
DocType | Citations | PageRank |
Conference | 2 | 0.38 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hanning Yuan | 1 | 2 | 0.38 |
| Shuliang Wang | 2 | 202 | 32.66 |
| Yang Yu | 3 | 24 | 13.21 |
| Ming Zhong | 4 | 20 | 5.59 |