{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:33:00Z","timestamp":1761561180063},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425366"},{"type":"electronic","value":"9783540447955"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44795-4_5","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T06:35:10Z","timestamp":1187159710000},"page":"49-60","source":"Crossref","is-referenced-by-count":14,"title":["A Framework for Learning Rules from Multiple Instance Data"],"prefix":"10.1007","author":[{"given":"Yann","family":"Chevaleyre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Daniel","family":"Zucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Erick Alphonse and Celine Rouveirol. Lazy propositionalization for relational learning. In ECAI, 2000.","DOI":"10.1007\/978-3-540-48247-5_29"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"P. Auer, P. Long, and Ashwin Srinivasan. Approximating hyper-rectangles: Learning and pseudo-random sets. In Annual ACM Symposium on Theory of Computing, 1997.","DOI":"10.1145\/258533.258611"},{"key":"5_CR3","unstructured":"Peter Auer. On learning from multi-instance examples: Empirical evaluation of a theoretical approach. In Proc. 14th International Conference on Machine Learning, 1997."},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009867806624","volume":"3","author":"H. Blockeel","year":"1999","unstructured":"Hendrik Blockeel, Luc De Raedt, Nico Jacobs, and Bart 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":"5_CR5","doi-asserted-by":"crossref","unstructured":"Avrim Blum and Adam Kalai. A note on learning from multiple-instance examples. Machine Learning, 30, 1998.","DOI":"10.1023\/A:1007402410823"},{"key":"5_CR6","unstructured":"Yann Chevaleyre and J.D. Zucker. Noise tolerant rule induction for multiple-instance data and potential data mining application. Tech. Rep. University of Paris 6, available at http:\/\/www-poleia.lip6.fr\/~chevaley\/michurning.ps , 2001."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"William W. Cohen. Fast effective rule induction. In Proc. 12th International Conference on Machine Learning. Morgan Kaufmann, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Thomas G. Dietterich, Richard H. Lathrop, and Tom\u00e1s Lozano-P\u00e9rez. Solving the multiple instance problem with axis-parallel rectangles. Artificial Intelligence, 89(1\u20132), 1997.","DOI":"10.1016\/S0004-3702(96)00034-3"},{"key":"5_CR9","unstructured":"Eibe Frank and Ian H.Witten. Generating accurate rule sets without global optimization. In Proc. 15th ICML, 1998."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Attilio Giordana, Lorenza Saitta, Michele Sebag, and Marco Botta. Analyzing relational learning in the phase transition framework. In Proc. 17th ICML, 2000.","DOI":"10.1007\/3-540-39963-1_4"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"J.U. Kietz. Some lower bounds for the computational complexity of inductive logic programming.In ECML, 1993.","DOI":"10.1007\/3-540-56602-3_131"},{"key":"5_CR12","unstructured":"Oded Maron and Aparna Lakshmi Ratan. Multiple-instance learning for natural scene classification.In Proc. 15th ICML, pages 341\u2013349, 1998."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Luc De Raedt. Attribute-value learning versus inductive logic programming: The missing links. In Proc. 8th International Conference on ILP, 1998.","DOI":"10.1007\/BFb0027304"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Michele Sebag and Celine Rouveirol. Tractable induction and classification in first order logic. In IJCAI, Nagoya, Japan, 1997.","DOI":"10.1007\/3540635149_55"},{"key":"5_CR15","unstructured":"A. Srinivasan and S. Muggleton. Comparing the use of background knowledge by two ilp systems. In L. de Raedt, editor, ILP-95., Katholieke Universiteit Leuven, 1995."},{"key":"5_CR16","unstructured":"Jun Wang and Jean-Daniel Zucker. Solving multiple-instance problem: a lazy learning approach.In Proc. 17th ICML, 2000."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Jean-Daniel Zucker and Jean-Gabriel Ganascia. Learning structurally indeterminate clauses.In Proc. 8th International Conference on ILP. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0027327"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44795-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:54:39Z","timestamp":1684007679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44795-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8,30]]},"ISBN":["9783540425366","9783540447955"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44795-4_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001,8,30]]}}}