{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:37:05Z","timestamp":1725568625816},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161834"},{"type":"electronic","value":"9783642161841"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16184-1_6","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:40:58Z","timestamp":1288690858000},"page":"72-86","source":"Crossref","is-referenced-by-count":3,"title":["On Enumerating Frequent Closed Patterns with Key in Multi-relational Data"],"prefix":"10.1007","author":[{"given":"Hirohisa","family":"Seki","sequence":"first","affiliation":[]},{"given":"Yuya","family":"Honda","sequence":"additional","affiliation":[]},{"given":"Shinya","family":"Nagano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: VLDB, pp. 487\u2013499 (1994)"},{"key":"6_CR2","unstructured":"Appice, A., Ceci, M., Turi, A., Malerba, D.: A Parallel Distributed Algorithm for Relational Frequent Pattern Discovery from Very Large Data Sets. Intell. Data Anal. (2009) (to appear)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Arimura, H., Uno, T.: Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems. In: SIAM Int\u2019l. Conf. on Data Mining, pp. 1087\u20131098 (2009)","DOI":"10.1137\/1.9781611972795.93"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Blockeel, H., Sebag, M.: Scalability and efficiency in multi-relational data mining. SIGKDD Explorations Newsletter 2003\u00a04(2), 1\u201314 (2003)","DOI":"10.1145\/959242.959246"},{"key":"6_CR5","unstructured":"Dehaspe, L.: Frequent pattern discovery in first-order logic, PhD thesis, Dept.\u00a0Computer Science, Katholieke Universiteit Leuven (1998)"},{"key":"6_CR6","unstructured":"De Raedt, L., Ramon, J.: Condensed representations for Inductive Logic Programming. In: Proc. KR 2004, pp. 438\u2013446 (2004)"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/959242.959245","volume":"5","author":"S. Dzeroski","year":"2003","unstructured":"Dzeroski, S.: Multi-Relational Data Mining: An Introduction. SIGKDD Explorations Newsletter\u00a05(1), 1\u201316 (2003)","journal-title":"SIGKDD Explorations Newsletter"},{"volume-title":"Relational Data Mining","year":"2001","key":"6_CR8","unstructured":"Dzeroski, S., Lavra\u010d, N. (eds.): Relational Data Mining. Springer, Heidelberg (2001)"},{"key":"6_CR9","volume-title":"Database System Implementation","author":"H. Garcia-Molina","year":"1999","unstructured":"Garcia-Molina, H., Widom, J., Ullman, J.D.: Database System Implementation. Prentice-Hall, Inc., Englewood Cliffs (1999)"},{"key":"6_CR10","unstructured":"Garriga, G.C., Khardon, R., De Raedt, L.: On Mining Closed Sets in Multi-Relational Data. In: IJCAI 2007, pp.804\u2013809 (2007)"},{"key":"6_CR11","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2005","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann Publishers Inc., San Francisco (2005)","edition":"2"},{"key":"6_CR12","unstructured":"Helft, N.: Induction as nonmonotonic inference. In: Proc. KR 1989, pp. 149\u2013156 (1989)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/383779.383781","volume":"2","author":"N. Lavra\u010d","year":"2001","unstructured":"Lavra\u010d, N., Flach, P.A.: An Extended Transformation Approach to Inductive Logic Programming. ACM Trans.\u00a0Computational Logic\u00a02(4), 458\u2013494 (2001)","journal-title":"ACM Trans.\u00a0Computational Logic"},{"key":"6_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"6_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-73847-3_32","volume-title":"Inductive Logic Programming","author":"J. Motoyama","year":"2007","unstructured":"Motoyama, J., Urazawa, S., Nakano, T., Inuzuka, N.: A Mining Algorithm using Property Items Extracted from Sampled Examples. In: Muggleton, S.H., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol.\u00a04455, pp. 335\u2013350. Springer, Heidelberg (2007)"},{"key":"6_CR16","unstructured":"Nagano, S., Honda, Y., Seki, H.: On Enumerating Frequent Closed Patterns in Multi-Relational Data Mining. In: Proc. WiNF 2009, pp. 89\u201394 (2009) (in Japanese)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"6_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","volume-title":"Discovery Science","author":"T. Uno","year":"2004","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 16\u201331. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16184-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T21:04:48Z","timestamp":1559768688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16184-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161834","9783642161841"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16184-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}