By Topic

An Incremental Algorithm Based on Irregular Grid for Clustering Data Stream

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

3 Author(s)
Guisheng Yin ; Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin ; Xiang Yu ; Guang Yang

The CluStream algorithm can not process arbitrary shapes of clusters well. Having analyzed the nature of data stream, proposed the incremental clustering algorithm based on irregular grid in data stream, namely, IIGStream. IIGStream has the advantage of clustering fast which traditional grid clustering algorithms has, and it adjust the structure of grid dynamically. To new coming data points, it promises the effectiveness of clustering of different cluster shapes by judging whether the grids are connected. During the process of clustering, it need not specify the number of clusters in advance, and it is not sensitive to outliers. The experiments on real datasets and synthetic datasets show the applicability and validity of IIGStream.

Published in:

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Date of Conference:

12-14 Oct. 2008