{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:01:28Z","timestamp":1725516088142},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540692942"},{"type":"electronic","value":"9783540692959"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69295-9_22","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:38:25Z","timestamp":1217486305000},"page":"264-278","source":"Crossref","is-referenced-by-count":0,"title":["Discovery of Useful Patterns from Tree-Structured Documents with Label-Projected Database"],"prefix":"10.1007","author":[{"given":"Juryon","family":"Paik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junghyun","family":"Nam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hee Yong","family":"Youn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ung Mo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Satamoto, H., Arikawa, S.: Efficient Substructure Discovery from Large Semi-Strucutured Data. In: Proceedings of the 2nd SIAM International Conference on Data Mining, pp. 158\u2013174 (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"22_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of the 20th International Conference on Very Large Databases (VLDB 1994), pp. 487\u2013499 (1994)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ipl.2005.11.022","volume":"98","author":"Y. Chen","year":"2006","unstructured":"Chen, Y., Chen, Y.: A New Tree Inclusion Algorithm. Information Processing Letters\u00a098, 253\u2013262 (2006)","journal-title":"Information Processing Letters"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10115-004-0180-7","volume":"8","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Canonical Forms for Labeled Trees and Their Applications in Frequent Subtree Mining. Knowledge and Information Systems\u00a08(2), 203\u2013234 (2005)","journal-title":"Knowledge and Information Systems"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of 2000 ACM SIGMOD International Conference on Management of Data (ICMD 2000), pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"22_CR6","first-page":"469","volume-title":"Information Modelling and Knowledge Bases","author":"H. Mannila","year":"1990","unstructured":"Mannila, H., Raiha, K.-J.: On Query Languages for the P-String Data Model. In: Information Modelling and Knowledge Bases, pp. 469\u2013482. IOS Press, Amsterdam (1990)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1007\/11428862_113","volume-title":"Computational Science \u2013 ICCS 2005","author":"J. Paik","year":"2005","unstructured":"Paik, J., Shin, D.R., Kim, U.M.: EFoX: a Scalable Method for Extracting Frequent Subtrees. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol.\u00a03516, pp. 813\u2013817. Springer, Heidelberg (2005)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2005","author":"J. Paik","year":"2005","unstructured":"Paik, J., Won, D., Fotouhi, F., Kim, U.M.: EXiT-B: a New Approch for Extracting Maximal Frequent Subtrees from XML Data. In: Gallagher, M., Hogan, J.P., Maire, F. (eds.) IDEAL 2005. LNCS, vol.\u00a03578, pp. 1\u20138. Springer, Heidelberg (2005)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M.-C., Sebag, M.: TreeFinder: a First Step towards XML Data Mining. In: Proceedings of IEEE International Conference on Data Mining (ICDM 2002), pp. 450\u2013457 (2002)","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"22_CR10","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, H., 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":"22_CR11","unstructured":"Wang, K., Liu, H.: Schema Discovery for Semistructured Data. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD 1997), pp. 271\u2013274 (1997)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Yao, J.-F., Li, Z., Dunham, M.H.: Efficient Data Mining for Maximal Frequent Subtrees. In: Proceedings of IEEE International Conference on Data Mining (ICDM 2003), pp. 379\u2013386 (2003)","DOI":"10.1109\/ICDM.2003.1250943"},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/69.846291","volume":"12","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering\u00a012(3), 290\u2013372 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"8","key":"22_CR14","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"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","first-page":"18","volume-title":"Advances in Web-Age Information Management","author":"L. Zou","year":"2006","unstructured":"Zou, L., Lu, Y., Zhang, H.: Mining Frequent Induced Subtrees by Prefix-Tree-Projected Pattern Growth. In: Yu, J.X., Kitsuregawa, M., Leong, H.-V. (eds.) WAIM 2006. LNCS, vol.\u00a04016, pp. 18\u201325. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Autonomic and Trusted Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69295-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:33:59Z","timestamp":1620016439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69295-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540692942","9783540692959"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69295-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}