{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:21:10Z","timestamp":1747196470054,"version":"3.40.5"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135595"},{"type":"electronic","value":"9783319135601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13560-1_37","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:24:07Z","timestamp":1415960647000},"page":"459-471","source":"Crossref","is-referenced-by-count":1,"title":["BEST: An Efficient Algorithm for Mining Frequent Unordered Embedded Subtrees"],"prefix":"10.1007","author":[{"given":"Israt Jahan","family":"Chowdhury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richi","family":"Nayak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Aggarwal, C.C.: XRules: An Effective Structural Classifier for XML Data. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 316\u2013325. ACM, Washington, D.C. (2003)","DOI":"10.1145\/956755.956787"},{"key":"37_CR2","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-38812-5_18","volume-title":"Inductive Logic Programming","author":"Y. Yoshimura","year":"2013","unstructured":"Yoshimura, Y., Shoudai, T.: Learning Unordered Tree Contraction Patterns in Polynomial Time. In: Riguzzi, F., \u017delezn\u00fd, F. (eds.) ILP 2012. LNCS (LNAI), vol.\u00a07842, pp. 257\u2013272. Springer, Heidelberg (2013)"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.-L., Zhang, S.: Unordered tree mining with applications to phylogeny. In: Proceedings of the 20th International Conference on Data Engineering (ICDE 2004), pp. 708\u2013719. IEEE (2004)","DOI":"10.1109\/ICDE.2004.1320039"},{"key":"37_CR4","first-page":"519","volume-title":"Proceedings of the 19th International Conference on Data Engineering","author":"Y. Wang","year":"2003","unstructured":"Wang, Y., De Witt, D.J., Cai, J.-Y.: X-Diff: An Effective Change Detection Algorithm for XML Documents. In: Proceedings of the 19th International Conference on Data Engineering, pp. 519\u2013530. IEEE, Vienna (2003)"},{"issue":"1-2","key":"37_CR5","first-page":"33","volume":"66","author":"M.J. Zaki","year":"2004","unstructured":"Zaki, M.J.: Efficiently Mining Frequent Embedded Unordered Trees. Fundamental Informatic\u00a066(1-2), 33\u201352 (2004)","journal-title":"Fundamental Informatic"},{"key":"37_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04921-1","volume-title":"Algorithms on Trees and Graphs","author":"G. Valiente","year":"2002","unstructured":"Valiente, G.: Algorithms on Trees and Graphs. Springer, Heidelberg (2002)"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-41230-1_35","volume-title":"Web Information Systems Engineering \u2013 WISE 2013","author":"I.J. Chowdhury","year":"2013","unstructured":"Chowdhury, I.J., Nayak, R.: A Novel Method for Finding Similarities between Unordered Trees Using Matrix Data Model. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds.) WISE 2013, Part I. LNCS, vol.\u00a08180, pp. 421\u2013430. Springer, Heidelberg (2013)"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-11749-2_12","volume-title":"Web Information Systems Engineering \u2013 WISE 2014","author":"I.J. Chowdhury","year":"2014","unstructured":"Chowdhury, I.J., Nayak, R.: BOSTER: An Efficient Algorithm for Mining Frequent Unordered Induced Subtrees. In: Benatallah, B., Bestavros, A., Manolopoulos, Y., Vakali, A., Zhang, Y. (eds.) WISE 2014, Part I. LNCS, vol.\u00a08786, pp. 146\u2013155. Springer, Heidelberg (2014)"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Hadzic, F., Tan, H., Dillon, T.S.: U3 - Mning Unordered Embedded Subtrees Using TMG Candidate Generation. In: Proceedings of the 2008 IEEE\/WIC\/ACM International Conference on Web Intelligence and Intelligent Agent Technology, vol.\u00a001, pp. 285\u2013292. IEEE Computer Society (2008)","DOI":"10.1109\/WIIAT.2008.403"},{"issue":"3","key":"37_CR10","first-page":"325","volume":"38","author":"F. Luccio","year":"2007","unstructured":"Luccio, F., Pagli, L., Enriquez, A.M., Rieumont, P.O.: Bottom-up subtree isomorphism for unordered labeled trees. International Journal of Pure and Applied Mathematics\u00a038(3), 325 (2007)","journal-title":"International Journal of Pure and Applied Mathematics"},{"key":"37_CR11","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.-I.: 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)"},{"key":"37_CR12","unstructured":"Nijssenm, S., Kok, J.N.: Efficient Discovery of Frequent Unordered Trees. In: First International Workshop on Mining Graphs, Trees and Sequences. Springer, Heidelberg (2003)"},{"issue":"2","key":"37_CR13","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 Labelled Trees and Their Applications in Frequent Subtree Mining. Knowledge and Information System\u00a08(2), 203\u2013234 (2005)","journal-title":"Knowledge and Information System"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Hadzic, F., Tan, H., Dillon, T.S.: UNI3 - Efficient Algorithm for Mining Unordered Induced Subtrees Using TMG Candidate Generation. In: Proceedings of the 1st IEEE Symposium on Computational Intelligence and Data Mining, Honolulu, Hawaii, pp. 568\u2013575 (2007)","DOI":"10.1109\/CIDM.2007.368926"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Chehreghani, M.H., Rahgozar, M., Lucas, C.: Mining maximal embedded unordered tree patterns. In: IEEE Symposium on Computational Intelligence and Data Mining (CIDM 2007), pp. 437\u2013443. IEEE (2007)","DOI":"10.1109\/CIDM.2007.368907"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M.-C., Sebag, M.: Treefinder: A first step towards xml data mining. In: IEEE International Conference on Data Mining (ICDM 2002), pp. 450\u2013457. IEEE (2002)","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/775047.775058","volume-title":"Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"M.J. Zaki","year":"2002","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 71\u201380. ACM, Edmonton (2002)"},{"key":"37_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/11731139_52","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Tan","year":"2006","unstructured":"Tan, H., Dillon, T.S., Hadzic, F., Chang, E., Feng, L.: IMB3-Miner: mining induced\/embedded subtrees by constraining the level of embedding. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol.\u00a03918, pp. 450\u2013461. Springer, Heidelberg (2006)"},{"key":"37_CR19","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann Publishers Inc. (1994)"},{"issue":"8","key":"37_CR20","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"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2014: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13560-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:51:15Z","timestamp":1747158675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13560-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135595","9783319135601"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13560-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}