{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T14:51:47Z","timestamp":1772549507932,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540220640","type":"print"},{"value":"9783540247753","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_9","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T19:48:20Z","timestamp":1284148100000},"page":"63-73","source":"Crossref","is-referenced-by-count":41,"title":["CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees"],"prefix":"10.1007","author":[{"given":"Yun","family":"Chi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yirong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard R.","family":"Muntz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.E.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Satamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proc. of the 2nd SIAM Int. Conf. on Data Mining (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering frequent substructures in large unordered trees. In: Proc. of the 6th Intl. Conf. on Discovery Science (2003)","DOI":"10.1007\/978-3-540-39644-4_6"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: Proc. of the 2003 IEEE Int. Conf. on Data Mining (2003)","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"9_CR5","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Mining frequent rooted trees and free trees using canonical forms. Technical Report CSD-TR No. 030043, UCLA (2003), \n                    \n                      ftp:\/\/ftp.cs.ucla.edu\/techreport\/2003-reports\/030043.pdf"},{"key":"9_CR6","unstructured":"Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: CMTreeMiner: Mining both closed and maximal frequent subtrees. Technical Report CSD-TR No. 030053, UCLA (2003), \n                    \n                      ftp:\/\/ftp.cs.ucla.edu\/tech-report\/2003-reports\/030053.pdf"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"9_CR8","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 2003 IEEE Int. Conf. on Data Mining (2003)","DOI":"10.1109\/ICDM.2003.1250943"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)","DOI":"10.1145\/775047.775058"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Aggarwal, C.C.: XRules: An effective structural classifier for XML data. In: Proc. of the 2003 Int. Conf. Knowledge Discovery and Data Mining (2003)","DOI":"10.1145\/956750.956787"}],"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_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:09:58Z","timestamp":1619996998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}