{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:40:49Z","timestamp":1725536449010},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041242"},{"type":"electronic","value":"9783642041259"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04125-9_5","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T11:14:40Z","timestamp":1251285280000},"page":"15-24","source":"Crossref","is-referenced-by-count":0,"title":["Frequent Itemset Mining in Multirelational Databases"],"prefix":"10.1007","author":[{"given":"A\u00edda","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Berzal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Carlos","family":"Cubero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TKDE.2003.1161581","volume":"15","author":"A.K.H. Tung","year":"2003","unstructured":"Tung, A.K.H., Lu, H., Han, J., Feng, L.: Efficient mining of intertransaction association rules. IEEE Transaction on Knowlegde and Data Engeneering\u00a015(1), 43\u201356 (2003)","journal-title":"IEEE Transaction on Knowlegde and Data Engeneering"},{"issue":"17","key":"5_CR2","doi-asserted-by":"publisher","first-page":"3453","DOI":"10.1016\/j.ins.2007.03.007","volume":"177","author":"A.J.T. Lee","year":"2007","unstructured":"Lee, A.J.T., Wang, C.S.: An efficient algorithm for mining frequent inter-transaction patterns. Inf. Sci.\u00a0177(17), 3453\u20133476 (2007)","journal-title":"Inf. Sci."},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/959242.959245","volume":"5","author":"S. D\u017eeroski","year":"2003","unstructured":"D\u017eeroski, S.: Multi-relational data mining: An introduction. SIGKDD Explorations Newsletter\u00a05(1), 1\u201316 (2003)","journal-title":"SIGKDD Explorations Newsletter"},{"key":"5_CR4","unstructured":"Yin, X., Han, J., Yang, J., Yu, P.S.: CrossMine: efficient classification across multiple database relations. In: International Conference on Data Engineering, pp. 399\u2013410 (2004)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Yin, X., Han, J., Yu, P.S.: Cross-relational clustering with user\u2019s guidance. In: Knowledge Discovery and Data Mining, pp. 344\u2013353 (2005)","DOI":"10.1145\/1081870.1081910"},{"key":"5_CR6","series-title":"The Addison-Wesley Object Technology Series","volume-title":"Unified Modeling Language User Guide","author":"G. Booch","year":"2005","unstructured":"Booch, G., Rumbaugh, J., Jacobson, I.: Unified Modeling Language User Guide, 2nd edn. The Addison-Wesley Object Technology Series. Addison-Wesley Professional, Reading (2005)","edition":"2"},{"issue":"8","key":"5_CR7","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"},{"issue":"1-2","key":"5_CR8","first-page":"33","volume":"66","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae\u00a066(1-2), 33\u201352 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-68123-6_12","volume-title":"Foundations of Intelligent Systems","author":"A. Jimenez","year":"2008","unstructured":"Jimenez, A., Berzal, F., Cubero, J.C.: Mining induced and embedded subtrees in ordered, unordered, and partially-ordered trees. In: An, A., Matwin, S., Ra\u015b, Z.W., \u015al\u0119zak, D. (eds.) Foundations of Intelligent Systems. LNCS (LNAI), vol.\u00a04994, pp. 111\u2013120. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"5_CR10","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. Fundamenta Informaticae\u00a066(1-2), 161\u2013198 (2005)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04125-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T05:24:28Z","timestamp":1558502668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04125-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041242","9783642041259"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04125-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}