DocumentCode
3449528
Title
An Incremental Algorithm Based on Irregular Grid for Clustering Data Stream
Author
Yin, Guisheng ; Yu, Xiang ; Yang, Guang
Author_Institution
Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin
fYear
2008
fDate
12-14 Oct. 2008
Firstpage
1
Lastpage
5
Abstract
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.
Keywords
data mining; pattern clustering; CluStream algorithm; IIGStream; clustering data stream; grid clustering algorithms; incremental algorithm; irregular grid; Algorithm design and analysis; Clustering algorithms; Computer science; Data engineering; Data mining; Educational institutions; Information analysis; Iterative algorithms; Shape; Streaming media;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
Conference_Location
Dalian
Print_ISBN
978-1-4244-2107-7
Electronic_ISBN
978-1-4244-2108-4
Type
conf
DOI
10.1109/WiCom.2008.1351
Filename
4679259
Link To Document