Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy

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. It is simple but efficient since it is noniterative and needs few parameters. However, the improper selection of its para...

Celý popis

Podrobná bibliografie

Vydáno v:	Knowledge-based systems Ročník 133; s. 208 - 220
Hlavní autoři:	Yaohui, Liu, Zhengming, Ma, Fang, Yu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.10.2017 Elsevier Science Ltd
Témata:	Adaptive algorithms Aggregating Algorithms Clustering Clustering algorithm Clusters Density Density peaks Experiments K-nearest neighbors K-nearest neighbors Density peaks Clustering algorithm Aggregating
ISSN:	0950-7051, 1872-7409
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!