{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:02:24Z","timestamp":1759683744487},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_54","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:48:20Z","timestamp":1284162500000},"page":"441-451","source":"Crossref","is-referenced-by-count":47,"title":["Efficient Pattern-Growth Methods for Frequent Tree Pattern Mining"],"prefix":"10.1007","author":[{"given":"Chen","family":"Wang","sequence":"first","affiliation":[]},{"given":"Mingsheng","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[]},{"given":"Haofeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baile","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"54_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R.C. Agarwal","year":"2001","unstructured":"Agarwal, R.C., et al.: A tree projection algorithm for generation of frequent item sets. J. of Parallel and Distributed Computing\u00a061(3), 350\u2013371 (2001)","journal-title":"J. of Parallel and Distributed Computing"},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Asai, T., et al.: Efficient substructure discovery from large semi-structured data. In: Proc. 2002 SIAM Int. Conf. Data Mining, Arlington, VA (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"54_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D. Cook","year":"1994","unstructured":"Cook, D., Holder, L.: Substructure discovery using minimal description length and background knowledge. J. of Artificial Intelligence Research\u00a01, 231\u2013255 (1994)","journal-title":"J. of Artificial Intelligence Research"},{"key":"54_CR4","unstructured":"Dehaspe, L., et al.: Finding frequent substructures in chemical compounds. In: KDD 1998, New York, NY (1998)"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., et al.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, Dallas, TX (2000)","DOI":"10.1145\/342009.335372"},{"key":"54_CR6","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM 2001, San Jose, CA (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"54_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-45357-1_8","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Miyahara","year":"2001","unstructured":"Miyahara, T., et al.: Discovery of frequent tree structured patterns in semistructured web documents. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol.\u00a02035, p. 47. Springer, Heidelberg (2001)"},{"key":"54_CR8","unstructured":"Pei, J., et al.: H-Mine: Hyper-structure mining of frequent patterns in large databases. In: ICDM 2001, San Jose, CA (2001)"},{"key":"54_CR9","unstructured":"Pei, J., et al.: PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: ICDE 2001, Heidelberg, Germany (2001)"},{"key":"54_CR10","unstructured":"Srikant, R., Agrawal, R.: Mining generalized association rules. In: VLDB 1995, Zurich, Switzerland (1995)"},{"key":"54_CR11","unstructured":"Wang, J.T.L., et al.: Automated discovery of active motifs in multiple RNA secondary structures. In: KDD 1996, Portland, Oregon (1996)"},{"key":"54_CR12","unstructured":"Wang, K., Liu, H.: Schema discovery for semistructured data. In: KDD 1997, Newport Beach, CA (1997)"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: KDD 2002, Edmonton, Alberta, Canada (2002)","DOI":"10.1145\/775047.775058"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:09:51Z","timestamp":1620011391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}