DocumentCode
2850777
Title
Clustering on demand for multiple data streams
Author
Dai, Bi-Ru ; Huang, Jen-Wei ; Yeh, Mi-Yen ; Chen, Ming-Syan
Author_Institution
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fYear
2004
fDate
1-4 Nov. 2004
Firstpage
367
Lastpage
370
Abstract
In the data stream environment, the patterns generated by the mining techniques are usually distinct at different time because of the evolution of data. In order to deal with various types of multiple data streams and to support flexible mining requirements, we devise in this paper a clustering on demand framework, abbreviated as COD framework, to dynamically cluster multiple data streams. While providing a general framework of clustering on multiple data streams, the COD framework has two major features, namely one data scan for online statistics collection and compact multiresolution approximations, which are designed to address, respectively, the time and the space constraints in a data stream environment. Furthermore, with the multiresolution approximations of data streams, flexible clustering demands can be supported.
Keywords
computational complexity; data mining; pattern clustering; clustering-on-demand; compact multiresolution approximations; data evolution; flexible mining requirements; multiple data streams; online statistics collection; pattern generation; space constraints; time constraints; Aggregates; Association rules; Clustering algorithms; Data mining; Frequency; Investments; Multiresolution analysis; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining, 2004. ICDM '04. Fourth IEEE International Conference on
Print_ISBN
0-7695-2142-8
Type
conf
DOI
10.1109/ICDM.2004.10060
Filename
1410312
Link To Document