{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:05:33Z","timestamp":1725483933270},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677956"},{"type":"electronic","value":"9783540449607"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44960-4_4","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:59:31Z","timestamp":1178211571000},"page":"60-77","source":"Crossref","is-referenced-by-count":20,"title":["Executing Query Packs in ILP"],"prefix":"10.1007","author":[{"given":"Hendrik","family":"Blockeel","sequence":"first","affiliation":[]},{"given":"Luc","family":"Dehaspe","sequence":"additional","affiliation":[]},{"given":"Bart","family":"Demoen","sequence":"additional","affiliation":[]},{"given":"Gerda","family":"Janssens","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Vandecasteele","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"4_CR1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules. In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307\u2013328. The MIT Press, 1996."},{"key":"4_CR2","unstructured":"H. Blockeel. Top-down induction of first order logical decision trees PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven, 1998. \n                    http:\/\/www.cs.kuleuven.ac.be\/~ml\/PS\/blockeel98:phd.ps.gz\n                    \n                  ."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"H. Blockeel and L. De Raedt. Lookahead and discretization in ILP. In Proceedings of the 7th International Workshop on Inductive Logic Programming, volume 1297 of Lecture Notes in Artificial Intelligence, pages 77\u201385. Springer-Verlag, 1997.","DOI":"10.1007\/3540635149_36"},{"issue":"1-2","key":"4_CR4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H. Blockeel","year":"1998","unstructured":"H. Blockeel and L. De Raedt. Top-down induction of first order logical decision trees. Artificial Intelligence, 101(1-2):285\u2013297, June 1998.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009867806624","volume":"3","author":"H. Blockeel","year":"1999","unstructured":"H. Blockeel, L. De Raedt, N. Jacobs, and B. Demoen. Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery, 3(1):59\u201393, 1999.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"4_CR6","unstructured":"M. Bongard. Pattern Recognition. Spartan Books, 1970."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20\u201374, January 1996. See also \n                    http:\/\/www.cs.sunysb.edu\/~sbprolog\n                    \n                  .","DOI":"10.1145\/227595.227597"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L. Raedt De","year":"1997","unstructured":"L. De Raedt. Logical settings for concept learning. Artificial Intelligence, 95:187\u2013201, 1997.","journal-title":"Artificial Intelligence"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"L. De Raedt and W. Van Laer. Inductive constraint logic. In Klaus P Jantke, Takeshi Shinohara, and Thomas Zeugmann, editors, Proceedings of the 6th International Workshop on Algorithmic Learning Theory, volume 997 of Lecture Notes in Artificial Intelligence, pages 80\u201394. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60454-5_30"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"L. Dehaspe and H. Toivonen. Discovery of frequent datalog patterns. Data Mining and Knowledge Discovery, 3(1):7\u201336, 1999.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"4_CR11","unstructured":"Bart Demoen, Gerda Janssens, and Henk Vandecasteele. Executing query flocks for ILP. In Sandro Etalle, editor, Proceedings of the Eleventh Benelux Workshop on Logic Programming, Maastricht, The Netherlands, November 1999. 14 pages."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"M. Mehta, R. Agrawal, and J. Rissanen. SLIQ: A fast scalable classifier for data mining. In Proceedings of the Fifth International Conference on Extending Database Technology, 1996.","DOI":"10.1007\/BFb0014141"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"S. Muggleton. Inverse entailment and Progol. New Generation Computing, 13, 1995.","DOI":"10.1007\/BF03037227"},{"key":"4_CR14","unstructured":"J. Ross Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann series in machine learning. Morgan Kaufmann, 1993."},{"key":"4_CR15","unstructured":"A. Srinivasan, S.H. Muggleton, and R.D. King. Comparing the use of background knowledge by inductive logic programming systems. In L. De Raedt, editor, Proceedings of the 5th International Workshop on Inductive Logic Programming, 1995."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Dick Tsur, Jeffrey D. Ullman, Serge Abiteboul, Chris Clifton, Rajeev Motwani, Svetlozar Nestorov, and Arnon Rosenthal. Query flocks: A generalization of association-rule mining. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD-98), volume 27,2 of ACM SIGMOD Record, pages 1\u201312, New York, June1\u20134 1998. ACM Press.","DOI":"10.1145\/276304.276306"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44960-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T11:53:59Z","timestamp":1550318039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44960-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677956","9783540449607"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44960-4_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}