By Topic

Irregular Grid-Based Clustering over High-Dimensional Data Streams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
GuiBin Hou ; Coll. of Inf. Sci. & Eng., Yanshan Univ., Qinhuangdao, China ; RuiXia Yao ; Jiadong Ren ; Changzhen Hu

Clustering high-dimensional data stream is a difficult and important problem. Grid-based algorithms are easily influenced by the size and borders of the grid. To overcome the weakness, we propose a new Irregualr Grid-based Clustering algorithm for high-dimensional data streams, called IGDCL. This method incorporates an irregular grid structure and subspace clustering algorithm. In this paper, an irregular grid structure is generated by means of splitting each dimension into different grid cells. With new data arriving, the irregular grid structure is dynamically adjusted. We assign a fading density function for each data point to embody the evolution of data streams. The final clusters are obtained in subspaces which are formed by dimensions associated with corresponding clusters. Experimental results demonstrate that IGDCL has higher clustering quality than CluStream.

Published in:

Pervasive Computing Signal Processing and Applications (PCSPA), 2010 First International Conference on

Date of Conference:

17-19 Sept. 2010