Self-adaptive anytime stream clustering

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2009, Pages 249-258

  Kranen, Philipp ^a   Assent, Ira ^b   Baldauf, Corinna ^a   Seidl, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

Anytime algorithms; Self adaptive algorithms; Stream clustering

Indexed keywords

ANYTIME ALGORITHM; CLUSTERING RESULTS; CONCEPT DRIFTS; DATA STREAM; INDEX STRUCTURE; INTER-ARRIVAL TIME; SELF ADAPTIVE ALGORITHMS; SELF-ADAPTIVE; SINGLE PASS; STREAMING DATA;

ADAPTIVE ALGORITHMS; DATA MINING; HYDRAULICS;

CLUSTERING ALGORITHMS;

EID: 77951189927     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2009.47     Document Type: Conference Paper

References (28)

1. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu, "A framework for clustering evolving data streams," in 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 VLDB, 2004, pp. 852-863.
3. B. Arai, G. Das, D. Gunopulos, and N. Koudas, "Anytime measures for top-k algorithms," in VLDB, 2007, pp. 914-925.
4. D. Barbaŕa and P. Chen, "Using the fractal dimension to cluster datasets," in KDD, 2000, pp. 260-264.
5. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: an efficient and robust access method for points and rectangles," in SIGMOD, 1990, pp. 322-331.
6. F. Cao, M. Ester, W. Qian, and A. Zhou, "Density-based clustering over an evolving data stream with noise," in SDM, 2006.
7. Y. Chen and L. Tu, "Density-based clustering for real-time stream data," in KDD, 2007, pp. 133-142.
8. D. DeCoste, "Anytime interval-valued outputs for kernel machines: Fast support vector machine classification via distance geometry," in ICML, 2002, pp. 99-106.
9. A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the em algorithm," J Royal Stat. Soc., B, vol. 39, no. 1, pp. 1-38, 1977.
10. R. Duda, P. Hart, and D. Stork, Pattern Classification (2nd Ed.). Wiley, 2000.
11. A. Guttman, "R-trees: A dynamic index structure for spatial searching," in SIGMOD, 1984, pp. 47-57.
12. S. Hettich and S. Bay, "The UCI KDD archive http://kdd.ics.uci.edu, " 1999.
13. A. Jain, Z. Zhang, and E. Y. Chang, "Adaptive non-linear clustering in data streams," in CIKM, 2006, pp. 122-131.
14. P. Kranen, "Using index structures for anytime stream mining," in PhD Workshop VLDB, Lyon, France, 2009.
15. P. Kranen and T. Seidl, "Harnessing the strengths of anytime algorithms for constant data streams," DMKD J, Special Issue on Selected Papers from ECML PKDD, Vol. 19, No. 2,, pp. 245-260, 2009.
16. S. Lühr and M. Lazarescu, "Incremental clustering of dynamic data streams using connectivity based representative points," Data Knowl. Eng., vol. 68, no. 1, pp. 1-27, 2009.
17. L. O'Callaghan, A. Meyerson, R. Motwani, N. Mishra, and S. Guha, "Streaming-data algorithms for high-quality clustering," in ICDE, 2002.
18. T. Seidl, I. Assent, P. Kranen, R. Krieger, and J. Herrmann, "Indexing density models for incremental learning and anytime classification on data streams," in EDBT, 2009.
19. M. Spiliopoulou, I. Ntoutsi, Y. Theodoridis, and R. Schult, "Monic: modeling and monitoring cluster transitions," in KDD, 2006, pp. 706-711.
20. E. J. Spinosa, A. C. Ponce de Leon Ferreira de Carvalho, and J. Gama, "Olindda: a cluster-based approach for detecting novelty and concept drift in data streams," in SAC, 2007.
21. W. N. Street and Y. Kim, "A streaming ensemble algorithm (sea) for large-scale classification," in KDD, 2001.
22. K. Udommanetanakit, T. Rakthanmanon, and K. Waiyamai, "E-stream: Evolution-based technique for stream clustering," in ADMA, 2007, pp. 605-615.
23. K. Ueno, X. Xi, E. J. Keogh, and D.-Y. Lee, "Anytime classification using the nearest neighbor algorithm with applications to stream mining," in ICDM, 2006, pp. 623-632.
24. M. van Leeuwen and A. Siebes, "Streamkrimp: Detecting change in data streams," in ECML/PKDD, 2008.
25. M. Vlachos, J. Lin, E. Keogh, and D. Gunopulos, "A waveletbased anytime algorithm for k-means clustering of time series," in WS Clust. High Dim. Data & App. (at ICDM), 2003.
26. H. Wang, W. Fan, P. S. Yu, and J. Han, "Mining conceptdrifting data streams using ensemble classifiers," in KDD, 2003, pp. 226-235.
27. Y. Yang, G. I.Webb, K. B. Korb, and K. M. Ting, "Classifying under computational resource constraints: anytime classification using probabilistic estimators," Machine Learning, vol. 69, no. 1, 2007.
28. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: an efficient data clustering method for very large databases," in SIGMOD, 1996.