loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth IEEE International Conference on Data Mining (ICDM'04)
Clustering on Demand for Multiple Data Streams
Brighton, United Kingdom
November 01-November 04
ISBN: 0-7695-2142-8
Bi-Ru Dai, National Taiwan University, Taipei
Jen-Wei Huang, National Taiwan University, Taipei
Mi-Yen Yeh, National Taiwan University, Taipei
Ming-Syan Chen, National Taiwan University, Taipei
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 multi-resolution approximations, which are designed to address, respectively, the time and the space constraints in a data stream environment. Furthermore, with the multi-resolution approximations of data streams, flexible clustering demands can be supported.
Citation:
Bi-Ru Dai, Jen-Wei Huang, Mi-Yen Yeh, Ming-Syan Chen, "Clustering on Demand for Multiple Data Streams," icdm, pp.367-370, Fourth IEEE International Conference on Data Mining (ICDM'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.