{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:24Z","timestamp":1725512064314},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681229"},{"type":"electronic","value":"9783540681236"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68123-6_12","type":"book-chapter","created":{"date-parts":[[2008,5,9]],"date-time":"2008-05-09T08:11:39Z","timestamp":1210320699000},"page":"111-120","source":"Crossref","is-referenced-by-count":5,"title":["Mining Induced and Embedded Subtrees in Ordered, Unordered, and Partially-Ordered Trees"],"prefix":"10.1007","author":[{"given":"A\u00edda","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Berzal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Carlos","family":"Cubero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"12_CR1","first-page":"161","volume":"66","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining - an overview. Fundamenta Informaticae\u00a066(1-2), 161\u2013198 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR2","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: HybridTreeMiner: An efficient algorithm for mining frequent rooted trees and free trees using canonical form. In: SSDBM 2004, pp. 11\u201320 (2004)"},{"key":"12_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Abe, K., Kawasoe, S., Asai, T., Arimura, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: SDM 2002 (2002)","DOI":"10.1007\/3-540-45681-3_1"},{"key":"12_CR6","unstructured":"Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees. In: First International Workshop on Mining Graphs, Trees and Sequences (MGTS 2003), in conjunction with ECML\/PKDD 2003, pp. 55\u201364 (2003)"},{"key":"12_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume-title":"Discovery Science","author":"T. Asai","year":"2003","unstructured":"Asai, T., Arimura, H., Uno, T., ichi Nakano, S.: Discovering frequent substructures in large unordered trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 47\u201361. Springer, Heidelberg (2003)"},{"issue":"8","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest: Algorithms and applications. IEEE Transactions on Knowledge and Data Engineering\u00a017(8), 1021\u20131035 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1-2","key":"12_CR9","first-page":"33","volume":"66","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae\u00a066(1-2), 33\u201352 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Hido, S., Kawano, H.: AMIOT: induced ordered tree mining in tree-structured databases. In: ICDM 2005, pp. 170\u2013177 (2005)","DOI":"10.1109\/ICDM.2005.20"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Yao, J.F., Li, Z., Dunham, M.H.: Efficient data mining for maximal frequent subtrees. In: ICDM 2003, pp. 379\u2013386 (2003)","DOI":"10.1109\/ICDM.2003.1250943"},{"key":"12_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-540-24775-3_54","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C. Wang","year":"2004","unstructured":"Wang, C., Hong, M., Pei, J., Zhou, H., Wang, W., Shi, B.: Efficient pattern-growth methods for frequent tree pattern mining. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 441\u2013451. Springer, Heidelberg (2004)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M.C., Sebag, M.: TreeFinder: a first step towards xml data mining. In: ICDM 2002, pp. 450\u2013457 (2002)","DOI":"10.1109\/ICDM.2002.1183987"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Xia, Y., Yang, Y., Muntz, R.R.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Transactions on Knowledge and Data Engineering\u00a017(2), 190\u2013202 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: ICDM 2003, pp. 509\u2013512 (2003)","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Knowledge Discovery from XML Documents","year":"2006","unstructured":"Nayak, R., Zaki, M.J. (eds.): KDXD 2006. LNCS, vol.\u00a03915. Springer, Heidelberg (2006)"},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/959242.959245","volume":"5","author":"S. D\u017eeroski","year":"2003","unstructured":"D\u017eeroski, S.: Multi-relational data mining: An introduction. SIGKDD Explorations Newsletter\u00a05(1), 1\u201316 (2003)","journal-title":"SIGKDD Explorations Newsletter"},{"key":"12_CR18","unstructured":"Yin, X., Han, J., Yang, J., Yu, P.S.: CrossMine: efficient classification across multiple database relations. In: ICDE 2004, pp. 399\u2013410 (2004)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Yin, X., Han, J., Yu, P.S.: Cross-relational clustering with user\u2019s guidance. In: KDD 2005, pp. 344\u2013353 (2005)","DOI":"10.1145\/1081870.1081910"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Gall, H., Lanza, M., Zimmermann, T.: 4th International Workshop on Mining Software Repositories (MSR 2007). In: ICSE COMPANION 2007, pp. 107\u2013108 (2007)","DOI":"10.1109\/ICSECOMPANION.2007.8"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/978-3-540-77226-2_48","volume-title":"IDEAL 2007","author":"F. Berzal","year":"2007","unstructured":"Berzal, F., Cubero, J.C., Jimenez, A.: Hierarchical program representation for program element matching. In: Yin, H., Tino, P., Corchado, E., Byrne, W., Yao, X. (eds.) IDEAL 2007. LNCS, vol.\u00a04881, pp. 467\u2013476. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68123-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:35:39Z","timestamp":1620002139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68123-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681229","9783540681236"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68123-6_12","relation":{},"subject":[]}}