{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:14:58Z","timestamp":1725491698170},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738466"},{"type":"electronic","value":"9783540738473"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73847-3_32","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T03:23:12Z","timestamp":1190172192000},"page":"335-350","source":"Crossref","is-referenced-by-count":8,"title":["A Mining Algorithm Using Property Items Extracted from Sampled Examples"],"prefix":"10.1007","author":[{"given":"Jun-Ichi","family":"Motoyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinpei","family":"Urazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomofumi","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuhiro","family":"Inuzuka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","first-page":"487","volume-title":"Proc. VLDB","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. VLDB, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3540635149_40","volume-title":"Inductive Logic Programming","author":"L. Dehaspe","year":"1997","unstructured":"Dehaspe, L., De Raedt, L.: Mining association rules with multiple relations. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) Inductive Logic Programming. LNCS, vol.\u00a01297, pp. 125\u2013132. Springer, Heidelberg (1997)"},{"key":"32_CR3","unstructured":"Dehaspe, L.: Frequent pattern discovery in first-order logic, PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven (1998)"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-662-04599-2_8","volume-title":"Relational Data Mining","author":"L. Dehaspe","year":"2001","unstructured":"Dehaspe, L., Toivonen, H.: Discovery of Relational Association Rules. In: Dzeroski, S., Lavrac, N. (eds.) Relational Data Mining, pp. 189\u2013212. Springer, Heidelberg (2001)"},{"key":"32_CR5","unstructured":"De Raedt, L., Ramon, J.: Condensed Representations for Inductive Logic Programming. In: KR 2004, pp.438\u2013446 (2004)"},{"key":"32_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-48751-4_10","volume-title":"Inductive Logic Programming","author":"P.A. Flach","year":"1999","unstructured":"Flach, P.A., Lachiche, N.: 1BC: A first-order Bayesian classifier. In: D\u017eeroski, S., Flach, P.A. (eds.) Inductive Logic Programming. LNCS (LNAI), vol.\u00a01634, pp. 92\u2013103. Springer, Heidelberg (1999)"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3540635149_45","volume-title":"Inductive Logic Programming","author":"M. Furusawa","year":"1997","unstructured":"Furusawa, M., Inuzuka, N., Seki, H., Itoh, H.: Induction of Logic Programs with More Than One Recursive Clause by Analysing Saturations. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) Inductive Logic Programming. LNCS, vol.\u00a01297, pp. 165\u2013172. Springer, Heidelberg (1997)"},{"issue":"4","key":"32_CR8","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. Computational Logic\u00a02(4), 458\u2013494 (2001)","journal-title":"ACM Trans. Computational Logic"},{"issue":"2","key":"32_CR9","first-page":"313","volume":"19","author":"M.P. Marcus","year":"1994","unstructured":"Marcus, M.P., Santorini, B., Marcinkiewicz, M.A.: Building a large annotated corpus of english: The penn treebank. Comp. Linguistics\u00a019(2), 313\u2013330 (1994)","journal-title":"Comp. Linguistics"},{"key":"32_CR10","unstructured":"Michie, D., Muggleton, S., Page, D., Srinivasan, A.: Results of the new east-west challenge (1994), \n                    \n                      ftp:\/\/ftp.comlab.ox.ac.uk\/pub\/Packages\/ILP\/Trains\/results.tar.Z"},{"key":"32_CR11","unstructured":"Richards, B.L., Mooney, R.J.: Learning Rlations by Pathfinding. AAAI-92, pp. 50\u201352 (1992)"},{"key":"32_CR12","first-page":"64","volume-title":"Inductive Logic Programming","author":"C. Rouveirol","year":"1992","unstructured":"Rouveirol, C.: Extensions of Inversion of Resolution Applied to Theory Completion. In: Muggleton, S. (ed.) Inductive Logic Programming, pp. 64\u201390. Academic Press, San Diego (1992)"},{"issue":"1-2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0004-3702(95)00122-0","volume":"85","author":"A. Srinivasan","year":"1996","unstructured":"Srinivasan, A., Muggleton, S., Sternberg, M.J.E., King, R.D.: Theories for Mutagenicity: A Study in First-Order and Feature-Based Induction. Artificial Intelligence\u00a085(1-2), 277\u2013299 (1996)","journal-title":"Artificial Intelligence"},{"key":"32_CR14","unstructured":"East-West Challenge: Machine Learning Online Information Service (2000), \n                    \n                      ftp:\/\/ftp.mlnet.org\/ml-archive\/ILP\/public\/data\/east_west\/\n                    \n                    \n                   at MLnet"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73847-3_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:02:50Z","timestamp":1619517770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73847-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738466","9783540738473"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73847-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}