An incremental grid clustering algorithm based on density-dimension-tree

This paper proposes an approach to improve the existing grid-based clustering algorithms with a further grid partition strategy and an incremental clustering function. This new algorithm IGDDT is based on density-dimension tree, which has the ability to reuse the previous clustering results, and obt...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings (International Conference on Machine Learning and Cybernetics.) Jg. 1; S. 356 - 361
Hauptverfasser: Jiaolong Huang, Xiaolong Zhang
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.07.2013
Schlagworte:
Abstracts
Data stream
Density-dimension tree
Grid
Incremental clustering
Switches
ISSN:2160-133X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper proposes an approach to improve the existing grid-based clustering algorithms with a further grid partition strategy and an incremental clustering function. This new algorithm IGDDT is based on density-dimension tree, which has the ability to reuse the previous clustering results, and obtain the better clusters by further dividing the grid cell in the clustering process. The experimental results on both artificial and real datasets demonstrate that IGDDT is able to discover arbitrary shape of clusters, better performance than the previous clustering algorithms on both clustering accuracy and clustering efficiency.
ISSN:2160-133X
DOI:10.1109/ICMLC.2013.6890494