A framework for learning rules from multiple instance data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2167, Issue , 2001, Pages 49-60

  Chevaleyre, Yann ^a   Zucker, Jean Daniel ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION TREES; LEARNING SYSTEMS;

DECISION TREE TECHNIQUES; FEATURE VECTORS; FIRST-ORDER REPRESENTATION; GENERIC EXTENSIONS; LEARNING RULES; MULTIPLE INSTANCES; RULE LEARNERS; RULE LEARNING ALGORITHMS;

LEARNING ALGORITHMS;

EID: 84948152022     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. Erick Alphonse and Celine Rouveirol. Lazy propositionalization for relational learning. In ECAI, 2000.
2. P. Auer, P. Long, and Ashwin Srinivasan. Approximating hyper-rectangles: Learning and pseudo-random sets. In Annual ACM Symposium on Theory of Computing, 1997.
3. Peter Auer. On learning from multi-instance examples: Empirical evaluation of a theoretical approach. In Proc. 14th International Conference on Machine Learning, 1997.
4. 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–93, 1999.
5. Avrim Blum and Adam Kalai. A note on learning from multiple-instance examples. Machine Learning, 30, 1998.
6. 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.
7. William W. Cohen. Fast effective rule induction. In Proc. 12th International Conference on Machine Learning. Morgan Kaufmann, 1995.
8. Thomas G. Dietterich, Richard H. Lathrop, and Tomás Lozano-Pérez. Solving the multipleinstance problem with axis-parallel rectangles. Artificial Intelligence, 89(1-2), 1997.
9. Eibe Frank and Ian H. Witten. Generating accurate rule sets without global optimization. In Proc. 15th ICML, 1998.
10. Attilio Giordana, Lorenza Saitta, Michele Sebag, and Marco Botta. Analyzing relational learning in the phase transition framework. In Proc. 17th ICML, 2000.
11. J. U. Kietz. Some lower bounds for the computational complexity of inductive logic programming. In ECML, 1993.
12. Oded Maron and Aparna Lakshmi Ratan. Multiple-instance learning for natural scene classification. In Proc. 15th ICML, pages 341–349, 1998.
13. Luc De Raedt. Attribute-value learning versus inductive logic programming: The missing links. In Proc. 8th International Conference on ILP, 1998.
14. Michele Sebag and Celine Rouveirol. Tractable induction and classification in first order logic. In IJCAI, Nagoya, Japan, 1997.
15. 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.
16. Jun Wang and Jean-Daniel Zucker. Solving multiple-instance problem: a lazy learning approach. In Proc. 17th ICML, 2000.
17. Jean-Daniel Zucker and Jean-Gabriel Ganascia. Learning structurally indeterminate clauses. In Proc. 8th International Conference on ILP. Springer-Verlag, 1998.