Clustering by Detecting Density Peaks and Assigning Points by Similarity-First Search Based on Weighted K-Nearest Neighbors Graph
This paper presents an improved clustering algorithm for categorizing data with arbitrary shapes. Most of the conventional clustering approaches work only with round-shaped clusters. This task can be accomplished by quickly searching and finding clustering methods for density peaks (DPC), but in som...
Guardat en:
| Autors principals: | , , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Wiley
2020-01-01
|
| Col·lecció: | Complexity |
| Accés en línia: | http://dx.doi.org/10.1155/2020/1731075 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|