Efficiently tracing clusters over high-dimensional on-line data streams

Data and Knowledge Engineering

Volumn 68, Issue 3, 2009, Pages 362-379

  Lee, Jae Woo ^a   Park, Nam Hun ^a   Lee, Won Suk ^a  

^a Yonsei University   (South Korea)

Author keywords

Clustering; CS tree; Data stream; Grid based clustering; High dimensional data

Indexed keywords

SCALABILITY;

CLUSTERING; CS-TREE; DATA STREAM; GRID-BASED CLUSTERING; HIGH-DIMENSIONAL DATA;

TREES (MATHEMATICS);

EID: 61349152282     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2008.11.004     Document Type: Article

References (24)

1. M. Garofalakis, J. Gehrke, R. Rastogi, Querying and mining data streams: you only get one look, in: The Tutorial Notes of the 28th International Conference on Very Large Data Bases, 2002.
2. M. Datar, A. Gionis, P. Indyk, R. Motawi, Maintaining stream statistics over sliding window in: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 635-644.
3. Gaber M.M., Zaslavsky A.B., and Krishnaswamy S. Mining data streams: a review. SIGMOD Record 34 2 (2005) 18-26
4. Duda R.O., and Hart P.E. Pattern Classification and Scene Analysis (1973), A Wiley-Interscience Publication, New York
5. J. MacQueen, Some methods for classification and analysis of multivariate observations, in: Proc. of the Fifth Berkeley Symp., 1967, pp. 281-297.
6. T. Zhang, R. Ramakrishnan, M. Livny, Birch: an efficient data clustering method for very large databases, in: Proceedings of the ACM SIGMOD International Conference on Management of Data Montreal, Quebec, Canada, ACM Press, 1996, pp. 103-114.
7. S. Guha, R. Rastogi, K. Shim, CURE: an efficient clustering algorithm for large databases, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, June 1998, Seattle, Washington, USA, ACM Press, 1998, pp. 73-84.
8. M. Ester, H.-P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD '96), Portland, Oregon, AAAI Press, 1996, pp. 226-231.
9. P.A. Porras, P.G. Neumann, EMERALD: event monitoring enabling responses to anomalous live disturbances, in: Proceedings of the 20th National Information Systems Security Conference, October 1997, pp. 353-365.
10. C.C. Aggarwal, J. Han, J. Wang, P.S. Yu, A framework for clustering evolving data streams, in: Proceedings of the 29th international conference on Very large data bases, Berlin, Germany, 2003, pp. 81-92.
11. C.-H. Lee, C.-R. Lin, M.-S. Chen, Sliding-window filtering: an efficient algorithm for incremental mining, in: Proceedings of the 10th International Conference on Information and Knowledge Management, Atlanta, Georgia, USA, November 2001, pp. 263-270.
12. Guha S., Meyerson A., Mishra N., Motwani R., and O'Callaghan L. Clustering data streams: Theory and practice. IEEE Transactions on Knowledge and Data Engineering 15 3 (2003) 515-528
13. R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, Washington, June 1998, pp. 94-105.
14. Park N.H., and Lee W.S. A statistical grid-based clustering over data streams. ACM SIGMOD Record 33 1 (2004) 32-37
15. Park N.H., and Lee W.S. Cell trees: an Adaptive Synopsis structure for clustering multi-dimensional on-line data streams. Data & Knowledge Engineering 63 2 (2007) 528-549
16. C.H. Cheng, A.W. Fu, Y. Zhang, Entropy-based subspace clustering for mining numerical data, in: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-99), San Diego, August 1999, pp. 84-93.
17. L. O'Callaghan, N. Mishra, A. Meyerson, S. Guha, R. Motwani, STREAM-data algorithms for high-quality clustering, in: Proceedings of IEEE International Conference on Data Engineering (ICDE'02), March 2002, pp. 685.
18. KDD Cup 1999. .
19. W. Wang, J. Yang, R. Muntz, Sting: a statistical information grid approach to spatial data mining, in: Proceedings of 23rd International Conference on Very Large Data Bases, Athens, Greece, August 25-29, 1997, pp. 186-195.
20. Triola M.F., Goodman W.M., and Law R. Elementary Statistics First Canadian Edition (1999), Addison-Wesley, Don Mills, Ontario
21. T. Urruty, C. Djeraba, D.A. Simovici, Clustering by random projection, in: Proceedings of the 7th Industrial Conference on Data Mining, Lecture Notes in Computer Science, vol. 4597, Springer, Berlin, 2007, pp. 107-119.
22. Han J., Pei J., Dong G., and Wang K. Efficient computation of iceberg cubes with complex measures. ACM SIGMOD Record 30 2 (2001) 1-12
23. C.C. Aggarwal, C. Procopiuc, J.L. Wolf, P.S. Yu, J.S. Park, Fast algorithms for projected clustering, in: Proceedings of the ACM SIGMOD International Conference on Management of Data Philadelphia, Pennsylvania, USA, June 1999, pp. 61-72.
24. A. Goswami, R. Jin, G. Agrawal, Fast and exact out-of-core K-means clustering, in: Proceedings of the Fourth IEEE International Conference on Data Mining, Brighton, UK, November 2004, pp. 83-90.