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

Full description

Saved in:
Bibliographic Details
Published in:Proceedings (International Conference on Machine Learning and Cybernetics.) Vol. 1; pp. 356 - 361
Main Authors: Jiaolong Huang, Xiaolong Zhang
Format: Conference Proceeding
Language:English
Published: IEEE 01.07.2013
Subjects:
Abstracts
Data stream
Density-dimension tree
Grid
Incremental clustering
Switches
ISSN:2160-133X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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