{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:37:09Z","timestamp":1725568629573},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161834"},{"type":"electronic","value":"9783642161841"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16184-1_25","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T13:40:58Z","timestamp":1288705258000},"page":"356-370","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Mining of Closed Frequent Subtrees"],"prefix":"10.1007","author":[{"given":"Viet Anh","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","volume-title":"Data on the Web","author":"S. Abiteboul","year":"2000","unstructured":"Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web. Morgan Kaufmann, San Francisco (2000)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proc. the ACM SIGMOD Intl. Conf. on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient Substructure Discovery From Large Semi-structured Data. In: Proc. the Second SIAM International Conference on Data Mining (SDM 2002), pp. 158\u2013174 (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Asai, T., Arimura, H., Abe, K., Kawasoe, S., Arikawa, S.: Online Algorithms for Mining Semi-structured Data Stream. In: Proc. IEEE International Conference on Data Mining (ICDM 2002), pp. 27\u201334 (2002)","DOI":"10.1109\/ICDM.2002.1183882"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bifet, A., Gavalda, R.: Mining Adaptively Frequent Closed Unlabeled Rooted Trees in Data Streams. In: Proc. the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-08), pp. 34\u201342 (2008)","DOI":"10.1145\/1401890.1401900"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yan, X., Han, J.: IncSpan: Incremental Mining of Sequential Patterns in Large Database. In: Proc. the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-04), pp. 527\u2013532 (2004)","DOI":"10.1145\/1014052.1014114"},{"key":"25_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-24775-3_9","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y. Chi","year":"2004","unstructured":"Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 63\u201373. Springer, Heidelberg (2004)"},{"key":"25_CR8","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent Subtree Mining - An Overview. In: Fundamenta Informaticae, vol.\u00a066, pp. 161\u2013198 (2005)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Hashimoto, K., Takigawa, I., Shiga, M., Kanehisa, M., Mamitsuka, H.: Mining Significant Tree Patterns in Carbohydrate Sugar Chains. In: Proc. the 7th European Conference on Computational Biology, pp. 167\u2013173 (2008)","DOI":"10.1093\/bioinformatics\/btn293"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Hsieh, M., Wu, Y., Chen, A.: Discovering frequent tree patterns over data streams, in Proc. SIAM International Conference on Data Mining (SDM 2006), pp. 629-633 (2006)","DOI":"10.1137\/1.9781611972764.74"},{"key":"25_CR11","unstructured":"Nijssen, S., Kok, J.N.: Efficient Discovery of Frequent Unordered Trees. In: Proc. the First International Workshop on Mining Graphs, Trees and Sequences (MGTS2003), in conjunction with ECML\/PKDD 2003, pp. 55-64 (2003)"},{"key":"25_CR12","series-title":"Lecture Notes in Artificial Intelligence","first-page":"543","volume-title":"Advances in Data Mining","author":"A. Termier","year":"2004","unstructured":"Termier, A., Rousset, M.C., Sebag, M.: Dryade: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol.\u00a03275, pp. 543\u2013546. Springer, Heidelberg (2004)"},{"issue":"1","key":"25_CR13","first-page":"49","volume":"7","author":"D. Wang","year":"2007","unstructured":"Wang, D., Peng, G.: A New Marketing Channel Management Strategy Based on Frequent Subtree Mining. Communications of the IIMA\u00a07(1), 49\u201354 (2007)","journal-title":"Communications of the IIMA"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently Mining Frequent Trees in a Forest. In: Proc. the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002), pp. 71\u201380 (2002)","DOI":"10.1145\/775047.775058"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16184-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T01:13:12Z","timestamp":1553217192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16184-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161834","9783642161841"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16184-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}