An Efficient Data Stream Clustering Algorithm Based on Dynamic Grids

Abstract:

Article Preview

Data mining based on data stream has become one of hot research fields. In this paper we present a novel algorithm for clustering data streams based on dynamic grids named DG-CluStream. DG-CluStream partitions and prunes grids dynamically, improves the accuracy of grids gradually through saving feature tuples of grids. The algorithm can discover clusters with arbitrary shape and is more efficient than those static methods due to a notable decrease on the number of the grids. Through fading coefficient, DG-CluStream can also deal with the problem of concept drifting efficiently. The experimental results on real datasets and synthetic datasets demonstrate promising availabilities of the approach.

Info:

Periodical:

Edited by:

Wenya Tian and Linli Xu

Pages:

665-670

DOI:

10.4028/www.scientific.net/AMR.186.665

Citation:

Y. Wu and F. Gao, "An Efficient Data Stream Clustering Algorithm Based on Dynamic Grids", Advanced Materials Research, Vol. 186, pp. 665-670, 2011

Online since:

January 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.