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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Engineering applications of artificial intelligence Jg. 72; S. 213 - 227
Hauptverfasser:	Lu, Jianyun, Zhu, Qingsheng, Wu, Quanwang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.06.2018
Schlagworte:	[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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!