{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:11:26Z","timestamp":1749615086298,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319461274"},{"type":"electronic","value":"9783319461281"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46128-1_12","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T05:34:23Z","timestamp":1472880863000},"page":"182-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Transactional Tree Mining"],"prefix":"10.1007","author":[{"given":"Mostafa","family":"Haghir Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Haghir Chehreghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Satamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proceedings of the Second SIAM International Conference on Data Mining (SDM), pp. 158\u2013174. SIAM (2002)","DOI":"10.1137\/1.9781611972726.10"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1978782.1978793","volume":"7","author":"P Bille","year":"2011","unstructured":"Bille, P., Gortz, I.: The tree inclusion problem: in linear space and faster. ACM Trans. Algorithms 7(3), 1\u201347 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Chalmers, R., Almeroth, K.: Modeling the branching characteristics and efficiency gains of global multicast trees. In: Proceedings of the 20th IEEE International Conference on Computer Communications (INFOCOM), pp. 449\u2013458 (2001)","DOI":"10.1109\/INFCOM.2001.916734"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1109\/TNET.2002.804835","volume":"11","author":"RC Chalmers","year":"2003","unstructured":"Chalmers, R.C., Member, S., Almeroth, K.C.: On the topology of multicast trees. IEEE\/ACM Trans. Networking 11, 153\u2013165 (2003)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chehreghani, M.H.: Efficiently mining unordered trees. In: Proceedings of the 11th IEEE International Conference on Data Mining (ICDM), pp. 111\u2013120 (2011)","DOI":"10.1109\/ICDM.2011.62"},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/s10618-015-0439-5","volume":"30","author":"Mostafa Haghir Chehreghani","year":"2015","unstructured":"Chehreghani, M.H., Bruynooghe, M.: Mining rooted ordered trees under subtree homeomorphism. Data Mining and Knowledge Discovery, to appear. http:\/\/arxiv.org\/abs\/1412.1470, doi:10.1007\/s10618-015-0439-5","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TSMCA.2010.2096808","volume":"41","author":"MH Chehreghani","year":"2011","unstructured":"Chehreghani, M.H., Chehreghani, M.H., Lucas, C., Rahgozar, M.: OInduced: an efficient algorithm for mining induced patterns from rooted ordered trees. IEEE Trans. Syst. Man Cybern., Part A 41(5), 1013\u20131025 (2011)","journal-title":"IEEE Trans. Syst. Man Cybern., Part A"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM), pp. 509\u2013512 (2003)","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-24775-3_9","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y Chi","year":"2004","unstructured":"Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: CMTreeMiner: mining both closed and maximal frequent subtrees. In: Bailey, J., Khan, L., Washio, T., Dobbie, G., Huang, J.Z., Wang, R. (eds.) PAKDD 2016. LNCS (LNAI), vol. 9651, pp. 63\u201373. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24775-3_9"},{"key":"12_CR10","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"Reinhard Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, 4th ed. Springer, Heidelberg (2010)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Maintaining order in a linked list. In: Proceedings of the 14th ACM Symposium on Theory of Computing (STOC), pp. 122\u2013127 (1982)","DOI":"10.1145\/800070.802184"},{"key":"12_CR12","unstructured":"Sidhu, A.S., Dillon, T.S., Chang, E.: Protein ontology. In: Ma, Z., Chen, J.Y. (eds.) Database Modeling in Biology: Practices and Challenges, pp. 39\u201360. Springer, New York (2006)"},{"issue":"2","key":"12_CR13","first-page":"1","volume":"2","author":"Henry 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. ACM Trans. Knowl. Discov. Data (TKDD) 2(2), 43 (2008)","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"694","DOI":"10.14778\/1687627.1687706","volume":"2","author":"S Tatikonda","year":"2009","unstructured":"Tatikonda, S., Parthasarathy, S.: Mining tree-structured data on multicore systems. Proc. VLDB Endowment (PVLDB) 2(1), 694\u2013705 (2009)","journal-title":"Proc. VLDB Endowment (PVLDB)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Tatikonda, S., Parthasarathy, S., Kurc, T.M.: TRIPS and TIDES: new algorithms for tree mining. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management (CIKM), pp. 455\u2013464 (2006)","DOI":"10.1145\/1183614.1183680"},{"key":"12_CR16","doi-asserted-by":"crossref","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 (KDD), pp. 71\u201380 (2002)","DOI":"10.1145\/775047.775058"},{"key":"12_CR17","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae 66(1\u20132), 33\u201352 (2005)"},{"issue":"8","key":"12_CR18","doi-asserted-by":"crossref","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 Trans. Knowl. Data Eng. 17(8), 1021\u20131035 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1\u20132","key":"12_CR19","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."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46128-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:40:32Z","timestamp":1749573632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-46128-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319461274","9783319461281"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46128-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riva del Garda","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}