{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T19:10:20Z","timestamp":1713467420277},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Datenbank Spektrum"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s13222-012-0083-9","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T14:55:22Z","timestamp":1328021722000},"page":"43-50","source":"Crossref","is-referenced-by-count":0,"title":["An Index-Inspired Algorithm for Anytime Classification on Evolving Data Streams"],"prefix":"10.1007","volume":"12","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":"Thomas","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,1]]},"reference":[{"issue":"2","key":"83_CR1","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s00778-008-0127-9","volume":"18","author":"B Arai","year":"2009","unstructured":"Arai B, Das G, Gunopulos D, Koudas N (2009) Anytime measures for top-k algorithms on exact and fuzzy data sets. VLDB J 18(2):407\u2013427","journal-title":"VLDB J"},{"key":"83_CR2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/93597.98741","volume-title":"SIGMOD","author":"N Beckmann","year":"1990","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp\u00a0322\u2013331"},{"key":"83_CR3","first-page":"738","volume-title":"AAAI","author":"MS Boddy","year":"1991","unstructured":"Boddy MS (1991) Anytime problem solving using dynamic programming. In: AAAI, pp\u00a0738\u2013743"},{"key":"83_CR4","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"83_CR5","first-page":"49","volume-title":"AAAI","author":"T Dean","year":"1988","unstructured":"Dean T, Boddy MS (1988) An analysis of time-dependent planning. In: AAAI, pp\u00a049\u201354"},{"key":"83_CR6","first-page":"99","volume-title":"ICML","author":"D DeCoste","year":"2002","unstructured":"DeCoste D (2002) Anytime interval-valued outputs for kernel machines: fast support vector machine classification via distance geometry. In: ICML, pp\u00a099\u2013106"},{"key":"83_CR7","first-page":"186","volume-title":"SDM","author":"D DeCoste","year":"2003","unstructured":"DeCoste D (2003) Anytime query-tuned kernel machines via Cholesky factorization. In: SDM, pp\u00a0186\u2013193"},{"key":"83_CR8","first-page":"115","volume-title":"ICML","author":"D DeCoste","year":"2003","unstructured":"DeCoste D, Mazzoni D (2003) Fast query-optimized kernel machine classification via incremental approximate nearest support vectors. In: ICML, pp\u00a0115\u2013122"},{"issue":"1","key":"83_CR9","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 NML, Rubin DB (1977) Maximum likelihood from incomplete data via the em algorithm. J R Stat Soc B 39(1):1\u201338","journal-title":"J R Stat Soc B"},{"issue":"3","key":"83_CR10","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10994-010-5228-1","volume":"82","author":"S Esmeir","year":"2011","unstructured":"Esmeir S, Markovitch S (2011) Anytime learning of anycost classifiers. Mach Learn (25th Anniversary) 82(3):445\u2013473","journal-title":"Mach Learn (25th Anniversary)"},{"key":"83_CR11","first-page":"40","volume-title":"ICML","author":"MJ Flores","year":"2009","unstructured":"Flores MJ, G\u00e1mez JA, Mart\u00ednez AM, Puerta JM (2009) Gaode and haode: two proposals based on aode to deal with continuous variables. In: ICML, pp\u00a040\u201347"},{"key":"83_CR12","unstructured":"Frank A, Asuncion A (2010) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"2","key":"83_CR13","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/242587.242592","volume":"7","author":"J Grass","year":"1996","unstructured":"Grass J, Zilberstein S (1996) Anytime algorithm development tools. SIGART Bull 7(2):20\u201327","journal-title":"SIGART Bull"},{"key":"83_CR14","first-page":"47","volume-title":"ACM SIGMOD","author":"A Guttman","year":"1984","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: ACM SIGMOD, pp\u00a047\u201357"},{"issue":"4","key":"83_CR15","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1142\/S0218213002001052","volume":"11","author":"EJ Keogh","year":"2002","unstructured":"Keogh EJ, Pazzani MJ (2002) Learning the structure of augmented Bayesian classifiers. Int J Artif Intell Tools 11(4):587\u2013601","journal-title":"Int J Artif Intell Tools"},{"key":"83_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10115-010-0342-8","volume":"29","author":"P Kranen","year":"2011","unstructured":"Kranen P, Assent I, Baldauf C, Seidl T (2011) The clustree: indexing micro-clusters for anytime stream mining. Knowl Inf Syst\u00a0J 29:249\u2013272","journal-title":"Knowl Inf Syst\u00a0J"},{"key":"83_CR17","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-642-13818-8_19","volume-title":"SSDBM","author":"P Kranen","year":"2010","unstructured":"Kranen P, G\u00fcnnemann S, Fries S, Seidl T (2010) MC-tree: improving Bayesian anytime classification. In: SSDBM. Lecture notes in computer science, pp\u00a0252\u2013269"},{"key":"83_CR18","first-page":"325","volume-title":"PAKDD","author":"P Kranen","year":"2010","unstructured":"Kranen P, Krieger R, Denker S, Seidl T (2010) Bulk loading hierarchical mixture models for efficient stream classification. In: PAKDD, pp\u00a0325\u2013334"},{"issue":"2","key":"83_CR19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10618-009-0139-0","volume":"19","author":"P Kranen","year":"2009","unstructured":"Kranen P, Seidl T (2009) Harnessing the strengths of anytime algorithms for constant data streams. Data Min Knowl Discov 19(2):245\u2013260","journal-title":"Data Min Knowl Discov"},{"issue":"14","key":"83_CR20","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1016\/j.artint.2007.11.009","volume":"172","author":"M Likhachev","year":"2008","unstructured":"Likhachev M, Ferguson D, Gordon GJ, Stentz A, Thrun S (2008) Anytime search in dynamic graphs. Artif Intell 172(14):1613\u20131643","journal-title":"Artif Intell"},{"key":"83_CR21","volume-title":"NIPS","author":"M Likhachev","year":"2003","unstructured":"Likhachev M, Gordon GJ, Thrun S (2003) ARA*: anytime A* with provable bounds on sub-optimality. In: NIPS."},{"key":"83_CR22","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/1516360.1516397","volume-title":"EDBT\/ICDT","author":"T Seidl","year":"2009","unstructured":"Seidl T, Assent I, Kranen P, Krieger R, Herrmann J (2009) Indexing density models for incremental learning and anytime classification on data streams. In: EDBT\/ICDT, pp\u00a0311\u2013322"},{"key":"83_CR23","first-page":"461","volume-title":"ICDM","author":"J Shieh","year":"2010","unstructured":"Shieh J, Keogh E (2010) Polishing the right apple: anytime classification also benefits data streams with constant arrival times. In: ICDM, pp\u00a0461\u2013470"},{"key":"83_CR24","first-page":"1102","volume-title":"ICDM","author":"DS Turaga","year":"2006","unstructured":"Turaga DS, Verscheure O, Chaudhari UV, Amini L (2006) Resource management for networked classifiers in distributed stream mining systems. In: ICDM, pp\u00a01102\u20131107"},{"key":"83_CR25","first-page":"623","volume-title":"ICDM","author":"K Ueno","year":"2006","unstructured":"Ueno K, Xi X, Keogh EJ, Lee DJ (2006) Anytime classification using the nearest neighbor algorithm with applications to stream mining. In: ICDM, pp\u00a0623\u2013632"},{"key":"83_CR26","volume-title":"Workshop on clustering high dimensionality data and its applications","author":"M Vlachos","year":"2003","unstructured":"Vlachos M, Lin J, Keogh EJ, Gunopulos D (2003) A wavelet-based anytime algorithm for k-means clustering of time series. In: Workshop on clustering high dimensionality data and its applications."},{"key":"83_CR27","first-page":"226","volume-title":"KDD","author":"H Wang","year":"2003","unstructured":"Wang H, Fan W, Yu PS, Han J (2003) Mining concept-drifting data streams using ensemble classifiers. In: KDD, pp\u00a0226\u2013235"},{"issue":"1","key":"83_CR28","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10994-005-4258-6","volume":"58","author":"GI Webb","year":"2005","unstructured":"Webb GI, Boughton JR, Wang Z (2005) Not so naive Bayes: aggregating one-dependence estimators. Mach Learn 58(1):5\u201324","journal-title":"Mach Learn"},{"issue":"12","key":"83_CR29","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1109\/TKDE.2007.190650","volume":"19","author":"Y Yang","year":"2007","unstructured":"Yang Y, Webb GI, Cerquides J, Korb KB, Boughton JR, Ting KM (2007) To select or to weigh: a\u00a0comparative study of linear combination schemes for superparent-one-dependence estimators. IEEE Trans Knowl Data Eng 19(12):1652\u20131665","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"83_CR30","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":"83_CR31","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1145\/1143844.1143984","volume-title":"ICML","author":"F Zheng","year":"2006","unstructured":"Zheng F, Webb GI (2006) Efficient lazy elimination for averaged one-dependence estimators. In: ICML, pp\u00a01113\u20131120"},{"key":"83_CR32","first-page":"490","volume-title":"ECML PKDD","author":"F Zheng","year":"2007","unstructured":"Zheng F, Webb GI (2007) Finding the right family: parent and child selection for averaged one-dependence estimators. In: ECML PKDD, pp\u00a0490\u2013501"},{"issue":"3","key":"83_CR33","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein S (1996) Using anytime algorithms in intelligent systems. AI Mag 17(3):73\u201383","journal-title":"AI Mag"}],"container-title":["Datenbank-Spektrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-012-0083-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13222-012-0083-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-012-0083-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T18:36:25Z","timestamp":1713465385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13222-012-0083-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s13222-012-0083-9","relation":{},"ISSN":["1618-2162","1610-1995"],"issn-type":[{"value":"1618-2162","type":"print"},{"value":"1610-1995","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,1]]}}}