The ClusTree: Indexing micro-clusters for anytime stream mining

Knowledge and Information Systems

Volumn 29, Issue 2, 2011, Pages 249-272

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

^a RWTH AACHEN UNIVERSITY   (Germany)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Anytime; Clustering; Data mining; Stream mining

Indexed keywords

EID: 80053927938     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-010-0342-8     Document Type: Article

References (35)

1. Aggarwal C (2009) On classification and segmentation of massive audio data streams. Knowl Inf Syst 20(2): 137-156.
2. Aggarwal CC, Han J, Wang J, Yu PS (2003) A framework for clustering evolving data streams. VLDB, Berlin, pp, pp 81-92.
3. Aggarwal CC, Han J, Wang J, Yu PS (2004) A framework for projected clustering of high dimensional data streams. VLDB, Toronto, pp, pp 852-863.
4. Arai B, Das G, Gunopulos D, Koudas N (2007) Anytime measures for top-k algorithms. VLDB, Vienna, pp, pp 914-925.
5. Assent I, Krieger R, Glavic B, Seidl T (2008) Clustering multidimensional sequences in spatial and temporal databases. Knowl Inf Syst 16(1): 29-51.
6. Barbará D, Chen P (2000) Using the fractal dimension to cluster datasets, KDD, pp 260-264.
7. Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD, Atlantic City, pp, pp 322-331.
8. Cao F, Ester M, Qian W, Zhou A (2006) Density-based clustering over an evolving data stream with noise, SDM.
9. Chen Y, Tu L (2007) Density-based clustering for real-time stream data, KDD, pp 133-142.
10. Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data streams. Knowl Inf Syst 16(1): 1-27.
11. Dang X, Ng W, Ong K (2008) Online mining of frequent sets in data streams with error guarantee. Knowl Inf Syst 16(2): 245-258.
12. DeCoste D (2002) Anytime interval-valued outputs for kernel machines: fast support vector machine classification via distance geometry, ICML, pp 99-106.
13. Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J Royal Stat Soc B 39(1): 1-38.
14. Duda R, Hart P, Stork D (2000) Pattern classification, 2nd edn. Wiley, London.
15. Gaber M, Zaslavsky A, Krishnaswamy S (2007) A survey of classification methods in data streams. Springer, Berlin, pp, pp 39-59.
16. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. SIGMOD, Boston, pp, pp 47-57.
17. Hettich S, Bay S (1999) The UCI KDD archive. http://kdd. ics. uci. edu.
18. Jain A, Zhang Z, Chang EY (2006) Adaptive non-linear clustering in data streams, CIKM, pp 122-131.
19. Kranen P, Krieger R, Denker S, Seidl T (2010) Bulk loading hierarchical mixture models for efficient stream classification. In: LNAI, Proceedings of 14th PAKDD.
20. Kranen P, Seidl T (2009) Harnessing the strengths of anytime algorithms for constant data streams. DMKD Journal, Special Issue on Selected Papers from ECML PKDD 19(2): 245-260.
21. Li H, Shan M, Lee S (2008) DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Knowl Inf Syst 17(1): 79-97.
22. Lühr S, Lazarescu M (2009) Incremental clustering of dynamic data streams using connectivity based representative points. Data Knowl Eng 68(1): 1-27.
23. O'Callaghan L, Meyerson A, Motwani R, Mishra N, Guha S (2002) Streaming-data algorithms for high-quality clustering. ICDE.
24. Seidl T, Assent I, Kranen P, Krieger R, Herrmann J (2009). Indexing density models for incremental learning and anytime classification on data streams, EDBT.
25. Spiliopoulou M, Ntoutsi I, Theodoridis Y, Schult R (2006) Monic: modeling and monitoring cluster transitions, KDD, pp 706-711.
26. Spinosa EJ, Ponce de Leon,Ferreira de Carvalho AC, Gama J (2007) Olindda: a cluster-based approach for detecting novelty and concept drift in data streams, SAC, pp 448-452.
27. Street WN, Kim Y (2001) A streaming ensemble algorithm (sea) for large-scale classification, KDD, pp 377-382.
28. Udommanetanakit K, Rakthanmanon T, Waiyamai K (2007) E-stream: evolutionbased technique for stream clustering, ADMA, pp 605-615.
29. Ueno K, Xi X, Keogh EJ, Lee D-Y (2006) Anytime classification using the nearest neighbor algorithm with applications to stream mining, ICDM, pp 623-632.
30. van Leeuwen M, Siebes A (2008) Streamkrimp: detecting change in data streams, ECML/PKDD, pp 672-687.
31. Vlachos M, Lin J, Keogh E, Gunopulos D(2003) A wavelet-based anytime algorithm for k-means clustering of time series. WS Clust. High Dim. Data & App. (at ICDM).
32. Wang H, Fan W, Yu PS, Han J (2003) Mining concept-drifting data streams using ensemble classifiers, KDD, pp 226-235.
33. Yang Y, Webb GI, Korb KB, Ting KM (2007) Classifying under computational resource constraints: anytime classification using probabilistic estimators. Mach Learn 69(1): 35-53.
34. Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. SIGMOD, NY, USA.
35. Zhou A, Cao F, Qian W, Jin C (2008) Tracking clusters in evolving data streams over sliding windows. Knowl Inf Syst 15(2): 181-214.