{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:02:21Z","timestamp":1743087741007,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575285"},{"type":"electronic","value":"9783319575292"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57529-2_17","type":"book-chapter","created":{"date-parts":[[2017,4,22]],"date-time":"2017-04-22T12:28:36Z","timestamp":1492864116000},"page":"208-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial Tree-Edit Distance: A Solution to the Default Class Problem in Pattern-Based Tree Classification"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Piernik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadeusz","family":"Morzy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,23]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TKDE.2011.209","volume":"25","author":"M Hachicha","year":"2013","unstructured":"Hachicha, M., Darmont, J.: A survey of XML tree patterns. IEEE Trans. Knowl. Data Eng. 25(1), 29\u201346 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1\u20133","key":"17_CR2","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0304-3975(03)00323-2","volume":"306","author":"S Dulucq","year":"2003","unstructured":"Dulucq, S., Tichit, L.: RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm. Theor. Comput. Sci. 306(1\u20133), 471\u2013484 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11736790_12","volume-title":"Machine Learning Challenges. Evaluating Predictive Uncertainty, Visual Object Classification, and Recognising Tectual Entailment","author":"M Kouylekov","year":"2006","unstructured":"Kouylekov, M., Magnini, B.: Combining lexical resources with tree edit distance for recognizing textual entailment. In: Qui\u00f1onero-Candela, J., Dagan, I., Magnini, B., d\u2019Alch\u00e9-Buc, F. (eds.) MLCW 2005. LNCS (LNAI), vol. 3944, pp. 217\u2013230. Springer, Heidelberg (2006). doi:10.1007\/11736790_12"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Augsten, N., Bohlen, M., Dyreson, C., Gamper, J.: Approximate joins for data-centric XML. In: IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 814\u2013823 (2008)","DOI":"10.1109\/ICDE.2008.4497490"},{"issue":"8","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1109\/TKDE.2010.245","volume":"23","author":"N Augsten","year":"2011","unstructured":"Augsten, N., Barbosa, D., Bohlen, M., Palpanas, T.: Efficient top-k approximate subtree matching in small memory. IEEE Trans. Knowl. Data Eng. 23(8), 1123\u20131137 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1\u20132","key":"17_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10994-006-5832-2","volume":"62","author":"MJ Zaki","year":"2006","unstructured":"Zaki, M.J., Aggarwal, C.C.: XRules: an effective algorithm for structural classification of XML data. Mach. Learn. 62(1\u20132), 137\u2013170 (2006)","journal-title":"Mach. Learn."},{"key":"17_CR7","unstructured":"Stefanowski, J.: Algorithms of rule induction for knowledge discovery. Habilitation thesis (2001)"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, S., Or, N.: A general algorithm for subtree similarity-search. In: Proceedings of the 30th International Conference on Data Engineering, ICDE 2014, pp. 928\u2013939 (2014)","DOI":"10.1109\/ICDE.2014.6816712"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, S.: Indexing for subtree similarity-search using edit distance. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, pp. 49\u201360 (2013)","DOI":"10.1145\/2463676.2463716"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45876-X_32","volume-title":"Advances in Database Technology \u2014 EDBT 2002","author":"S Amer-Yahia","year":"2002","unstructured":"Amer-Yahia, S., Cho, S.R., Srivastava, D.: Tree pattern relaxation. In: Jensen, C.S., \u0160altenis, S., Jeffery, K.G., Pokorny, J., Bertino, E., B\u00f6hn, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 496\u2013513. Springer, Heidelberg (2002). doi:10.1007\/3-540-45876-X_32"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1006\/jagm.1994.1003","volume":"16","author":"K Zhang","year":"1993","unstructured":"Zhang, K., Shasha, D., Wang, J.T.L.: Approximate tree matching in the presence of variable length don\u2019t cares. J. Algorithms 16, 33\u201366 (1993)","journal-title":"J. Algorithms"},{"key":"17_CR13","first-page":"707","volume":"10","author":"V Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl. 10, 707 (1966)","journal-title":"Sov. Phys. Dokl."},{"issue":"8","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans. Knowl. Data Eng. 17(8), 1021\u20131035 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR15","first-page":"1","volume":"7","author":"J Demsar","year":"2006","unstructured":"Demsar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57529-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:38:59Z","timestamp":1709822339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57529-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575285","9783319575292"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57529-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pakdd2017.snu.ac.kr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}