A novel data clustering algorithm using heuristic rules based on k-nearest neighbors chain

In practice, clustering algorithms usually suffer from the complex structure of the dataset, including data distribution and dimensionality. Meanwhile, the number of clusters, which is required as an input, is usually unavailable. In this paper, we propose a novel data clustering algorithm: it uses...

Celý popis

Podrobná bibliografie

Vydáno v:	Engineering applications of artificial intelligence Ročník 72; s. 213 - 227
Hlavní autoři:	Lu, Jianyun, Zhu, Qingsheng, Wu, Quanwang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.06.2018
Témata:	[formula omitted]-nearest neighbors chain Clustering algorithm Data mining Heuristic rule Random walk model K-nearest neighbors chain Random walk model Heuristic rule Data mining Clustering algorithm
ISSN:	0952-1976, 1873-6769
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!