{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:54:54Z","timestamp":1725882894445},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557526"},{"type":"electronic","value":"9783319557533"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55753-3_18","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:38:10Z","timestamp":1490053090000},"page":"279-294","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Discovering Most-Specific Mixed Patterns from Large Data Trees"],"prefix":"10.1007","author":[{"given":"Xiaoying","family":"Wu","sequence":"first","affiliation":[]},{"given":"Dimitri","family":"Theodoratos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00778-012-0295-5","volume":"22","author":"R Baca","year":"2013","unstructured":"Baca, R., Kr\u00e1tk\u00fd, M., Ling, T.W., Lu, J.: Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings. VLDB J. 22(3), 369\u2013393 (2013)","journal-title":"VLDB J."},{"doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD (2002)","key":"18_CR2","DOI":"10.1145\/564691.564727"},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y Chi","year":"2005","unstructured":"Chi, Y., Xia, Y., Yang, Y., Muntz, R.R.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans. Knowl. Data Eng. 17(2), 190\u2013202 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Dries, A., Nijssen, S.: Mining patterns in networks using homomorphism. In: SDM (2012)","key":"18_CR4","DOI":"10.1137\/1.9781611972825.23"},{"issue":"3","key":"18_CR5","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/s10618-013-0321-2","volume":"27","author":"AM Kibriya","year":"2013","unstructured":"Kibriya, A.M., Ramon, J.: Nearly exact mining of frequent trees in large networks. Data Min. Knowl. Disc. 27(3), 478\u2013504 (2013)","journal-title":"Data Min. Knowl. Disc."},{"issue":"2","key":"18_CR6","doi-asserted-by":"crossref","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."},{"doi-asserted-by":"crossref","unstructured":"Kim, S., Kim, H., Weninger, T., Han, J., Kim, H.D.: Authorship classification: a discriminative syntactic tree mining approach. In: SIGIR, pp. 455\u2013464 (2011)","key":"18_CR7","DOI":"10.1145\/2009916.2009979"},{"doi-asserted-by":"crossref","unstructured":"Knijf, J.D.: Fat-miner: mining frequent attribute trees. In: SAC, pp. 417\u2013422 (2007)","key":"18_CR8","DOI":"10.1145\/1244002.1244099"},{"issue":"1","key":"18_CR9","doi-asserted-by":"crossref","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"},{"issue":"2","key":"18_CR10","first-page":"9","volume":"2","author":"H Tan","year":"2008","unstructured":"Tan, H., Hadzic, F., Dillon, T.S., Chang, E., Feng, L.: Tree model guided candidate generation for mining frequent subtrees from XML documents. TKDD 2(2), 9 (2008)","journal-title":"TKDD"},{"doi-asserted-by":"crossref","unstructured":"Tatikonda, S., Parthasarathy, S., Kur\u00e7, T.M.: TRIPS and TIDES: new algorithms for tree mining. In: CIKM (2006)","key":"18_CR11","DOI":"10.1145\/1183614.1183680"},{"doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M.-C., Sebag, M., TreeFinder: a first step towards XML data mining. In: ICDM (2002)","key":"18_CR12","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"18_CR13","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). doi: 10.1007\/978-3-319-18120-2_1"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-32025-0_12","volume-title":"Database Systems for Advanced Applications","author":"X Wu","year":"2016","unstructured":"Wu, X., Theodoratos, D., Peng, Z.: Efficiently mining homomorphic patterns from large data trees. In: Navathe, S.B., Wu, W., Shekhar, S., Du, X., Wang, X.S., Xiong, H. (eds.) DASFAA 2016. LNCS, vol. 9642, pp. 180\u2013196. Springer, Cham (2016). doi: 10.1007\/978-3-319-32025-0_12"},{"issue":"6","key":"18_CR15","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/j.is.2013.02.003","volume":"38","author":"X Wu","year":"2013","unstructured":"Wu, X., Theodoratos, D., Wang, W.H., Sellis, T.: Optimizing XML queries: bitmapped materialized views vs. indexes. Inf. Syst. 38(6), 863\u2013884 (2013)","journal-title":"Inf. Syst."},{"issue":"1\u20132","key":"18_CR16","first-page":"35","volume":"66","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae 66(1\u20132), 35\u201352 (2005)","journal-title":"Fundamenta Informaticae"},{"issue":"8","key":"18_CR17","doi-asserted-by":"crossref","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."},{"issue":"6","key":"18_CR18","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1109\/TCYB.2014.2345579","volume":"45","author":"S Zhang","year":"2015","unstructured":"Zhang, S., Du, Z., Wang, J.T.: New techniques for mining frequent patterns in unordered trees. IEEE Trans. Cybern. 45(6), 1113\u20131125 (2015)","journal-title":"IEEE Trans. Cybern."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55753-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T09:05:09Z","timestamp":1498381509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55753-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319557526","9783319557533"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55753-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}