{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:09:40Z","timestamp":1751688580826,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914572"},{"type":"electronic","value":"9783319914589"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-319-91458-9_34","type":"book-chapter","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T20:34:15Z","timestamp":1526070855000},"page":"558-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Discovery of Embedded Patterns from Large Attributed Trees"],"prefix":"10.1007","author":[{"given":"Xiaoying","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Theodoratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,12]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2","volume-title":"Frequent Pattern Mining","year":"2014","unstructured":"Aggarwal, C.C., Han, J. (eds.): Frequent Pattern Mining. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07821-2"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: SDM (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD (2002)","DOI":"10.1145\/564691.564727"},{"issue":"5","key":"34_CR4","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/s10618-015-0439-5","volume":"30","author":"MH Chehreghani","year":"2016","unstructured":"Chehreghani, M.H., Bruynooghe, M.: Mining rooted ordered trees under subtree homeomorphism. Data Min. Knowl. Discov. 30(5), 1249\u20131272 (2016)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1\u20132","key":"34_CR5","first-page":"161","volume":"66","author":"Y Chi","year":"2005","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining - an overview. Fundam. Inform. 66(1\u20132), 161\u2013198 (2005)","journal-title":"Fundam. Inform."},{"issue":"2","key":"34_CR6","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. Knowl. Inf. Syst. 8(2), 203\u2013234 (2005)","journal-title":"Knowl. Inf. Syst."},{"issue":"7","key":"34_CR7","first-page":"517","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: GRAMI: frequent subgraph and pattern mining in a single large graph. PVLDB 7(7), 517\u2013528 (2014)","journal-title":"PVLDB"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM J. Comput. 24(2), 340\u2013356 (1995)","journal-title":"SIAM J. Comput."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Knijf, J.D.: FAT-miner: mining frequent attribute trees. In: SAC, pp. 417\u2013422 (2007)","DOI":"10.1145\/1244002.1244099"},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G Miklau","year":"2004","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1), 2\u201345 (2004)","journal-title":"J. ACM"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Miyoshi, Y., Ozaki, T., Ohkawa, T.: Frequent pattern discovery from a single graph with quantitative itemsets. In: ICDM Workshops, pp. 527\u2013532 (2009)","DOI":"10.1109\/ICDMW.2009.11"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10115-016-0953-9","volume":"50","author":"C Pasquier","year":"2017","unstructured":"Pasquier, C., Flouvat, F., Sanhes, J., Selmaoui-Folcher, N.: Attributed graph mining in the presence of automorphism. Knowl. Inf. Syst. 50(2), 569\u2013584 (2017)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"34_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10115-015-0831-x","volume":"46","author":"C Pasquier","year":"2016","unstructured":"Pasquier, C., Sanhes, J., Flouvat, F., Selmaoui-Folcher, N.: Frequent pattern mining in attributed trees: algorithms and applications. Knowl. Inf. Syst. 46(3), 491\u2013514 (2016)","journal-title":"Knowl. Inf. Syst."},{"key":"34_CR14","unstructured":"Weis, M., Naumann, F., Brosy, F.: A duplicate detection benchmark for xml (and relational) data (2006)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Wu, X., Souldatos, S., Theodoratos, D., Dalamagas, T., Sellis, T.K.: Efficient evaluation of generalized path pattern queries on XML data. In: WWW (2008)","DOI":"10.1145\/1367497.1367610"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-18120-2_1","volume-title":"Database Systems for Advanced Applications","author":"X Wu","year":"2015","unstructured":"Wu, X., Theodoratos, D.: Leveraging homomorphisms and bitmaps to enable the mining of embedded patterns from large data trees. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 3\u201320. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18120-2_1"},{"issue":"1\u20132","key":"34_CR17","first-page":"33","volume":"66","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundam. Inform. 66(1\u20132), 33\u201352 (2005)","journal-title":"Fundam. Inform."},{"issue":"8","key":"34_CR18","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."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91458-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:09:10Z","timestamp":1751634550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91458-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319914572","9783319914589"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91458-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ict.griffith.edu.au\/conferences\/dasfaa2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}