{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T14:10:31Z","timestamp":1738419031817,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540884101"},{"type":"electronic","value":"9783540884118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88411-8_27","type":"book-chapter","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T08:09:58Z","timestamp":1223366998000},"page":"284-295","source":"Crossref","is-referenced-by-count":1,"title":["Finding Frequent Patterns from Compressed Tree-Structured Data"],"prefix":"10.1007","author":[{"given":"Seiji","family":"Murakami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koichiro","family":"Doi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/1.9781611972726.10","volume-title":"Proc. of the 2nd SIAM International Conference on Data Mining (SDM 2002)","author":"T. Asai","year":"2002","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proc. of the 2nd SIAM International Conference on Data Mining (SDM 2002), pp. 158\u2013174. SIAM, Philadelphia (2002)"},{"key":"27_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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., 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":"2","key":"27_CR3","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 databeses 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":"27_CR4","unstructured":"Chi, Y., Yang, Y., Munts, R.R.: HybridTreeMiner: An efficient algorithm for mining frequent rooted trees and free trees using canonical forms. In: Proc. of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), June 2004, pp. 11\u201320 (2004)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Park, M.J., Min, J.K., Chung, C.W.: XPRESS: A queriable compression for XML data. In: Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 122\u2013133 (2003)","DOI":"10.1145\/872757.872775"},{"key":"27_CR7","unstructured":"Kudo, T.: FREQT: An implementation of FREQT (2003), http:\/\/www.chasen.org\/%7etaku\/software\/freqt\/"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Liefke, H., Suciu, D.: XMill: An efficient compressor for XML data. In: Proc. of the ACM SIGMOD International Conference on Management of Data, vol.\u00a029(2), pp. 153\u2013164 (2000)","DOI":"10.1145\/342009.335405"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"C.N. Manning","year":"1997","unstructured":"Manning, C.N., Witten, I.: Identifying hierarchical structure in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research\u00a07, 67\u201382 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"27_CR10","unstructured":"Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees. In: 1st International Workshop on Mining Graphs, Trees and Sequences (MGTS 2003), pp. 55\u201364 (2003)"},{"key":"27_CR11","unstructured":"Onuma, J., Doi, K., Yamamoto, A.: Data compression and anti-unification for semi-structured documents with tree grammars (in Japanese). IEICE Technical Report AI2006-9, pp. 45\u201350 (2006)"},{"issue":"3","key":"27_CR12","first-page":"370","volume":"42","author":"M. Takeda","year":"2001","unstructured":"Takeda, M., Shibata, Y., Matsumoto, T., Kida, T., Shinohara, A., Fukamachi, S., Shinohara, T., Arikawa, S.: Speeding up string pattern matching by text compression: The dawn of a new era. Transactions of Information Processing Society of Japan\u00a042(3), 370\u2013384 (2001)","journal-title":"Transactions of Information Processing Society of Japan"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M.-C., Sebag, M.: DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: Proc. of the 4th IEEE International Conference on Data Mining (ICDM 2004), pp. 543\u2013546 (2004)","DOI":"10.1109\/ICDM.2004.10078"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Tolani, P.M., Haritosa, J.R.: XGrind: A query-friendly XML compressor. In: Proc. of the 18th International Conference on Data Engineering (ICDE 2002), pp. 225\u2013234 (2002)","DOI":"10.1109\/ICDE.2002.994712"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Yao, J.F., Li, Z., Dunham, M.: Efficient data mining for maximal frequent subtrees. In: Proc. of the 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 379\u2013386 (2003)","DOI":"10.1109\/ICDM.2003.1250943"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proc. of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 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-540-88411-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T13:32:55Z","timestamp":1738416775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88411-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540884101","9783540884118"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88411-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}