Density-based clustering over an evolving data stream with noise

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 328-339

  Cao, Feng ^a   Ester, Martin ^b   Qian, Weining ^a   Zhou, Aoying ^a  

^a FUDAN UNIVERSITY   (China)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Data mining algorithms; Density based clustering; Evolving data streams

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DATA PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS;

DATA MINING ALGORITHMS; DENSITY BASED CLUSTERING; EVOLVING DATA STREAMS; MICROCLUSTERS;

DATA MINING;

EID: 33745434639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.29     Document Type: Conference Paper

References (18)

1. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In Proc. of VLDB, 2003.
2. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for projected clustering of high dimensional data streams. In Proc. of VLDB, 2004.
3. M. Ankerst, M. Breunig, H.-P. Kriegel, and J. Sander. Optics: Ordering points to identify the clustering structure. In Proc. of SIGMOD, pages 49-60, 1999.
4. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. In Proc. of STOC, pages 30-39, 2003.
5. B. Dai, J. Huang, M. Yeh, and M. Chen. Clustering on demand for multiple data streams. In Proc. of ICDM, pages 367-370, 2004.
6. P. Domingos and G. Hulten. Mining high-speed data streams. In Proc. of KDD, 2000.
7. P. Domingos and G. Hulton. A general method for scaling up machine learning algorithms and its application to clustering. In Proc. of the 18th International Conference on Machine Learning (ICML 2001), pages 106-113, 2001.
8. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. of KDD, 1996.
9. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. Incremental clustering for mining in a data warehousing environment. In Proc. of VLDB, pages 323-333, 1998.
10. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams:theory and practice. In IEEE Transactions on Knowledge and Data Engineering, pages 515-528, 2003.
11. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data stream. In Proc. of FOCS, 2000.
12. S. Guha, R. Rastogi, and K. Shim. Cure: An efficient clustering algorithm for large databases. In Proc. of SIGMOD, 1998.
13. A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia databases with noise. In Proc. of KDD, pages 58-65, 1998.
14. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In Proc. of VLDB, pages 346-357, 2002.
15. O. Nasraoui, C. Cardona, C. Rojas, and F. Gonzlez. Tecno-streams: tracking evolving clusters in noisy data streams with a scalable immune system learning model. In Proc. of ICDM, pages 235-242, 2003.
16. M. Stonebraker, J. Frew, K. Gardels, and J. Meredith. The sequoia 2000 storage benchmark. In Proc. of SIGMOD, pages 2-11, 1993.
17. W. Wang, J. Yang, and R. R. Muntz. Sting: A statistical information grid approach to spatial data mining. In Proc. of VLDB, pages 186-195, 1997.
18. J. Yang. Dynamic clustering of evolving streams with a single pass. In Proc. of ICDE, 2003.