{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:34:19Z","timestamp":1753439659711,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041792"},{"type":"electronic","value":"9783642041808"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04180-8_27","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T08:11:20Z","timestamp":1251360680000},"page":"147-162","source":"Crossref","is-referenced-by-count":10,"title":["Adaptive XML Tree Classification on Evolving Data Streams"],"prefix":"10.1007","author":[{"given":"Albert","family":"Bifet","sequence":"first","affiliation":[]},{"given":"Ricard","family":"Gavald\u00e0","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Arimura, H., Uno, T.: An output-polynomial time algorithm for mining frequent closed attribute trees. In: ILP, pp. 1\u201319 (2005)","DOI":"10.1007\/11536314_1"},{"key":"27_CR2","unstructured":"Balc\u00e1zar, J.L., Bifet, A., Lozano, A.: Mining implications from lattices of closed trees. In: Extraction et gestion des connaissances (EGC 2008), pp. 373\u2013384 (2008)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Balc\u00e1zar, J.L., Bifet, A., Lozano, A.: Mining frequent closed rooted trees. Accepted for publication in Machine Learning Journal (2009)","DOI":"10.1007\/s10994-009-5123-9"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Bifet, A., Gavald\u00e0, R.: Learning from time-changing data with adaptive windowing. In: SIAM International Conference on Data Mining (2007)","DOI":"10.1137\/1.9781611972771.42"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Bifet, A., Gavald\u00e0, R.: Mining adaptively frequent closed unlabeled rooted trees in data streams. In: 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2008)","DOI":"10.1145\/1401890.1401900"},{"key":"27_CR6","volume-title":"15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"A. Bifet","year":"2009","unstructured":"Bifet, A., Holmes, G., Pfahringer, B., Kirkby, R., Gavald\u00e0, R.: New ensemble methods for evolving data streams. In: 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York (2009)"},{"key":"27_CR7","first-page":"1001","volume":"XXI","author":"Y. Chi","year":"2001","unstructured":"Chi, Y., Xia, Y., Yang, Y., Muntz, R.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. Fundamenta Informaticae\u00a0XXI, 1001\u20131038 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Collins, M., Duffy, N.: New ranking algorithms for parsing and tagging: kernels over discrete structures, and the voted perceptron. In: ACL 2001, pp. 263\u2013270 (2001)","DOI":"10.3115\/1073083.1073128"},{"issue":"1","key":"27_CR9","first-page":"27","volume":"14","author":"M. Datar","year":"2002","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. SIAM Journal on Computing\u00a014(1), 27\u201345 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR10","first-page":"559","volume":"9","author":"G.C. Garriga","year":"2008","unstructured":"Garriga, G.C., Kralj, P., Lavra\u010d, N.: Closed sets for labeled data. J. Mach. Learn. Res.\u00a09, 559\u2013580 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"27_CR11","unstructured":"Holmes, G., Kirkby, R., Pfahringer, B.: MOA: Massive Online Analysis (2007), http:\/\/sourceforge.net\/projects\/moa-datastream"},{"key":"27_CR12","unstructured":"Kashima, H., Koyanagi, T.: Kernels for semi-structured data. In: ICML, pp. 291\u2013298 (2002)"},{"key":"27_CR13","unstructured":"Kudo, T., Maeda, E., Matsumoto, Y.: An application of boosting to graph classification. In: NIPS (2004)"},{"key":"27_CR14","unstructured":"Kudo, T., Matsumoto, Y.: A boosting algorithm for classification of semi-structured text. In: EMNLP, pp. 301\u2013308 (2004)"},{"key":"27_CR15","unstructured":"Li, J., Li, H., Wong, L., Pei, J., Dong, G.: Minimum description length principle: Generators are preferable to closed patterns. In: AAAI (2006)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Punin, J., Krishnamoorthy, M., Zaki, M.: LOGML: Log markup language for web usage mining. In: WEBKDD Workshop, with SIGKDD (2001)","DOI":"10.1007\/3-540-45640-6_5"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-540-71703-4_56","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"G.-j. Song","year":"2007","unstructured":"Song, G.-j., Yang, D.-q., Cui, B., Zheng, B., Liu, Y., Xie, K.-Q.: CLAIM: An efficient method for relaxed frequent closed itemsets mining over stream data. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol.\u00a04443, pp. 664\u2013675. Springer, Heidelberg (2007)"},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/TKDE.2007.190695","volume":"20","author":"A. Termier","year":"2008","unstructured":"Termier, A., Rousset, M.-C., Sebag, M., Ohara, K., Washio, T., Motoda, H.: DryadeParent, an efficient and robust closed attribute tree mining algorithm. IEEE Trans. Knowl. Data Eng.\u00a020(3), 300\u2013320 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"27_CR19","first-page":"286","volume-title":"KDD 2003","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: KDD 2003, pp. 286\u2013295. ACM Press, New York (2003)"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: KDD 2002 (2002)","DOI":"10.1145\/775056.775058"},{"key":"27_CR21","first-page":"316","volume-title":"KDD 2003","author":"M.J. Zaki","year":"2003","unstructured":"Zaki, M.J., Aggarwal, C.C.: XRules: an effective structural classifier for xml data. In: KDD 2003, pp. 316\u2013325. ACM Press, New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04180-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:52:40Z","timestamp":1739310760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04180-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041792","9783642041808"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04180-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}