{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:33:30Z","timestamp":1773156810431,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T00:00:00Z","timestamp":1285113600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10115-010-0342-8","type":"journal-article","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T10:44:31Z","timestamp":1285065871000},"page":"249-272","source":"Crossref","is-referenced-by-count":205,"title":["The ClusTree: indexing micro-clusters for anytime stream mining"],"prefix":"10.1007","volume":"29","author":[{"given":"Philipp","family":"Kranen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ira","family":"Assent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corinna","family":"Baldauf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,22]]},"reference":[{"issue":"2","key":"342_CR1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10115-008-0174-y","volume":"20","author":"C Aggarwal","year":"2009","unstructured":"Aggarwal C (2009) On classification and segmentation of massive audio data streams. Knowl Inf Syst 20(2): 137\u2013156","journal-title":"Knowl Inf Syst"},{"key":"342_CR2","first-page":"81","volume-title":"A framework for clustering evolving data streams","author":"CC Aggarwal","year":"2003","unstructured":"Aggarwal CC, Han J, Wang J, Yu PS (2003) A framework for clustering evolving data streams. VLDB, Berlin, pp, pp 81\u201392"},{"key":"342_CR3","first-page":"852","volume-title":"A framework for projected clustering of high dimensional data streams","author":"CC Aggarwal","year":"2004","unstructured":"Aggarwal CC, Han J, Wang J, Yu PS (2004) A framework for projected clustering of high dimensional data streams. VLDB, Toronto, pp, pp 852\u2013863"},{"key":"342_CR4","first-page":"914","volume-title":"Anytime measures for top-k algorithms","author":"B Arai","year":"2007","unstructured":"Arai B, Das G, Gunopulos D, Koudas N (2007) Anytime measures for top-k algorithms. VLDB, Vienna, pp, pp 914\u2013925"},{"issue":"1","key":"342_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10115-007-0121-3","volume":"16","author":"I Assent","year":"2008","unstructured":"Assent I, Krieger R, Glavic B, Seidl T (2008) Clustering multidimensional sequences in spatial and temporal databases. Knowl Inf Syst 16(1): 29\u201351","journal-title":"Knowl Inf Syst"},{"key":"342_CR6","doi-asserted-by":"crossref","unstructured":"Barbar\u00e1 D, Chen P (2000) Using the fractal dimension to cluster datasets, KDD, pp 260\u2013264","DOI":"10.1145\/347090.347145"},{"key":"342_CR7","first-page":"322","volume-title":"The R*-tree: an efficient and robust access method for points and rectangles","author":"N Beckmann","year":"1990","unstructured":"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\u2013331"},{"key":"342_CR8","doi-asserted-by":"crossref","unstructured":"Cao F, Ester M, Qian W, Zhou A (2006) Density-based clustering over an evolving data stream with noise, SDM","DOI":"10.1137\/1.9781611972764.29"},{"key":"342_CR9","doi-asserted-by":"crossref","unstructured":"Chen Y, Tu L (2007) Density-based clustering for real-time stream data, KDD, pp 133\u2013142","DOI":"10.1145\/1281192.1281210"},{"issue":"1","key":"342_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0092-4","volume":"16","author":"J Cheng","year":"2008","unstructured":"Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data streams. Knowl Inf Syst 16(1): 1\u201327","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"342_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10115-007-0106-2","volume":"16","author":"X Dang","year":"2008","unstructured":"Dang X, Ng W, Ong K (2008) Online mining of frequent sets in data streams with error guarantee. Knowl Inf Syst 16(2): 245\u2013258","journal-title":"Knowl Inf Syst"},{"key":"342_CR12","unstructured":"DeCoste D (2002) Anytime interval-valued outputs for kernel machines: fast support vector machine classification via distance geometry, ICML, pp 99\u2013106"},{"issue":"1","key":"342_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J Royal Stat Soc B 39(1): 1\u201338","journal-title":"J Royal Stat Soc B"},{"key":"342_CR14","volume-title":"Pattern classification","author":"R Duda","year":"2000","unstructured":"Duda R, Hart P, Stork D (2000) Pattern classification, 2nd edn. Wiley, London","edition":"2"},{"key":"342_CR15","first-page":"39","volume-title":"A survey of classification methods in data streams","author":"M Gaber","year":"2007","unstructured":"Gaber M, Zaslavsky A, Krishnaswamy S (2007) A survey of classification methods in data streams. Springer, Berlin, pp, pp 39\u201359"},{"key":"342_CR16","first-page":"47","volume-title":"R-trees: a dynamic index structure for spatial searching","author":"A Guttman","year":"1984","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. SIGMOD, Boston, pp, pp 47\u201357"},{"key":"342_CR17","unstructured":"Hettich S, Bay S (1999) The UCI KDD archive. http:\/\/kdd.ics.uci.edu"},{"key":"342_CR18","doi-asserted-by":"crossref","unstructured":"Jain A, Zhang Z, Chang EY (2006) Adaptive non-linear clustering in data streams, CIKM, pp 122\u2013131","DOI":"10.1145\/1183614.1183636"},{"key":"342_CR19","doi-asserted-by":"crossref","unstructured":"Kranen P, Krieger R, Denker S, Seidl T (2010) Bulk loading hierarchical mixture models for efficient stream classification. In: LNAI, Proceedings of 14th PAKDD","DOI":"10.1007\/978-3-642-13672-6_32"},{"key":"342_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013260","DOI":"10.1007\/978-3-642-04180-8_16"},{"issue":"1","key":"342_CR21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","volume":"17","author":"H Li","year":"2008","unstructured":"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\u201397","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"342_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.datak.2008.08.006","volume":"68","author":"S L\u00fchr","year":"2009","unstructured":"L\u00fchr S, Lazarescu M (2009) Incremental clustering of dynamic data streams using connectivity based representative points. Data Knowl Eng 68(1): 1\u201327","journal-title":"Data Knowl Eng"},{"key":"342_CR23","unstructured":"O\u2019Callaghan L, Meyerson A, Motwani R, Mishra N, Guha S (2002) Streaming-data algorithms for high-quality clustering. ICDE"},{"key":"342_CR24","doi-asserted-by":"crossref","unstructured":"Seidl T, Assent I, Kranen P, Krieger R, Herrmann J (2009). Indexing density models for incremental learning and anytime classification on data streams, EDBT","DOI":"10.1145\/1516360.1516397"},{"key":"342_CR25","doi-asserted-by":"crossref","unstructured":"Spiliopoulou M, Ntoutsi I, Theodoridis Y, Schult R (2006) Monic: modeling and monitoring cluster transitions, KDD, pp 706\u2013711","DOI":"10.1145\/1150402.1150491"},{"key":"342_CR26","doi-asserted-by":"crossref","unstructured":"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\u2013452","DOI":"10.1145\/1244002.1244107"},{"key":"342_CR27","doi-asserted-by":"crossref","unstructured":"Street WN, Kim Y (2001) A streaming ensemble algorithm (sea) for large-scale classification, KDD, pp 377\u2013382","DOI":"10.1145\/502512.502568"},{"key":"342_CR28","doi-asserted-by":"crossref","unstructured":"Udommanetanakit K, Rakthanmanon T, Waiyamai K (2007) E-stream: evolutionbased technique for stream clustering, ADMA, pp 605\u2013615","DOI":"10.1007\/978-3-540-73871-8_58"},{"key":"342_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013632","DOI":"10.1109\/ICDM.2006.21"},{"key":"342_CR30","doi-asserted-by":"crossref","unstructured":"van Leeuwen M, Siebes A (2008) Streamkrimp: detecting change in data streams, ECML\/PKDD, pp 672\u2013687","DOI":"10.1007\/978-3-540-87479-9_62"},{"key":"342_CR31","unstructured":"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)"},{"key":"342_CR32","doi-asserted-by":"crossref","unstructured":"Wang H, Fan W, Yu PS, Han J (2003) Mining concept-drifting data streams using ensemble classifiers, KDD, pp 226\u2013235","DOI":"10.1145\/956750.956778"},{"issue":"1","key":"342_CR33","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10994-007-5020-z","volume":"69","author":"Y Yang","year":"2007","unstructured":"Yang Y, Webb GI, Korb KB, Ting KM (2007) Classifying under computational resource constraints: anytime classification using probabilistic estimators. Mach Learn 69(1): 35\u201353","journal-title":"Mach Learn"},{"key":"342_CR34","doi-asserted-by":"crossref","DOI":"10.1145\/233269.233324","volume-title":"BIRCH: an efficient data clustering method for very large databases","author":"T Zhang","year":"1996","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. SIGMOD, NY, USA"},{"issue":"2","key":"342_CR35","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10115-007-0070-x","volume":"15","author":"A Zhou","year":"2008","unstructured":"Zhou A, Cao F, Qian W, Jin C (2008) Tracking clusters in evolving data streams over sliding windows. Knowl Inf Syst 15(2): 181\u2013214","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0342-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0342-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0342-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:37:52Z","timestamp":1740526672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0342-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,22]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["342"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0342-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,22]]}}}