{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:53:52Z","timestamp":1725519232943},"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_26","type":"book-chapter","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T04:09:58Z","timestamp":1223352598000},"page":"272-283","source":"Crossref","is-referenced-by-count":3,"title":["Mining Unordered Distance-Constrained Embedded Subtrees"],"prefix":"10.1007","author":[{"given":"Fedja","family":"Hadzic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tharam","family":"Dillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Chi, Y., Yirong, Y., Muntz, R.R.: Canonical Forms for Labeled Trees and Their Applications in Frequent Subtree Mining, Knowledge and Information Systems (2004)","DOI":"10.1007\/s10115-004-0180-7"},{"key":"26_CR2","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., Feng, L., Chang, E.: 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":"26_CR3","doi-asserted-by":"crossref","unstructured":"Tan, H., Hadzic, F., Dillon, T.S., Feng, L., Chang, E.: Tree Model Guided Candidate Generation for Mining Frequent Subtrees from XML. ACM Transactions on Knowledge Discovery from Data (TKDD) (to appear, 2007)","DOI":"10.1145\/1376815.1376818"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Hadzic, F., Dillon, T.S., Sidhu, A., Chang, E., Tan, H.: Mining Substructures in Protein Data. In: IEEE ICDM DMB Workshop, Hong Kong, 18-22 December (2006)","DOI":"10.1109\/ICDMW.2006.114"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Zhang, S.: Unordered Tree Mining with Applications to Phylogeny. In: 20th International Conference on Data Engineering (2004)","DOI":"10.1109\/ICDE.2004.1320039"},{"key":"26_CR6","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: HybridTreeMiner: An efficient algorihtm for mining frequent rooted trees and free trees using canonical forms. In: Proc. of the 16th Int\u2019l Conf. on Scientific and Statistical Database Management, Santorini Island, Greece (2004)"},{"key":"26_CR7","unstructured":"Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees. In: Int\u2019l Workshop on Mining Graphs, Trees, and Sequences (MGTS 2003), Dubrovnik, Croatia (2003)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering Frequent Substructures in Large Unordered Trees. In: 6th Int\u2019l Conf. on Discovery Science (2003)","DOI":"10.1007\/978-3-540-39644-4_6"},{"issue":"8","key":"26_CR9","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":"26_CR10","first-page":"1","volume-title":"Efficiently Mining Frequent Embedded Unordered Trees. Fundamenta Informaticae 65","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently Mining Frequent Embedded Unordered Trees. Fundamenta Informaticae 65, pp. 1\u201320. IOS Press, Amsterdam (2005)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Tan, H., Dillon, T.S., Hadzic, F., Chang, E.: Razor: mining distance-constrained embedded subtrees. In: Workshop on Ontology Mining and Knowledge Discovery from Semistructured documents (MSD 2006), in conjunction with ICDM 2006, Hong Kong, December 28-22 (2006)","DOI":"10.1109\/ICDMW.2006.138"},{"key":"26_CR12","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: IEEE Symposium on Computational Intelligence and Data Mining (CIDM 2007), Honolulu, Hawaii, April 1-5 (2007)","DOI":"10.1109\/CIDM.2007.368926"},{"key":"26_CR13","unstructured":"Hadzic, F., Tan, H., Dillon, T.S.: U3 \u2013 Mining Unordered Embedded Subtrees Using TMG Candidate Generation. In: ECML PKDD, Antwerp, Belgium, September 15-19 (submitted, 2008)"},{"key":"26_CR14","unstructured":"Tan, H., Hadzic, F., Dillon, T.S., Chang, E.: State of the art of data mining of tree structured information. International CSSE Journal\u00a023(2) (March 2008)"},{"key":"26_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04921-1","volume-title":"Algorithms on Trees and Graphs","author":"G. Valentine","year":"2002","unstructured":"Valentine, G.: Algorithms on Trees and Graphs. Springer, Berlin (2002)"},{"key":"26_CR16","unstructured":"Access Excellence @ the national health museum, Understanding gene testing: What does a predictive gene tell you, http:\/\/www.accessexcellence.org\/AE\/AEPC\/NIH\/gene14.html"}],"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_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T08:02:29Z","timestamp":1619510549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88411-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540884101","9783540884118"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88411-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}