A framework for learning Multiple-Instance Decision Trees and Rule Sets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2001

A framework for learning Multiple-Instance Decision Trees and Rule Sets

Résumé

This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is represented by a bag” of fixed-length feature vectors”.Such a representation,lying somewhere between propositional and first-order representation, offers a tradeoff between the two. Naive-RipperMi is one implementation of this extension on the rule learning algorithm Ripper. Several pitfalls encountered by this naive extension during induction are explained. A new multiple-instance search bias based on decision tree techniques is then used to avoid these pitfalls. Experimental results show the benefits of this approach for solving propositionalized relational problems in terms of speed and accuracy.

Dates et versions

hal-01571854 , version 1 (03-08-2017)

Identifiants

Citer

Yann Chevaleyre, Jean-Daniel Zucker. A framework for learning Multiple-Instance Decision Trees and Rule Sets. European Conference on Machine Learning, Sep 2001, Freiburg, Germany. pp.49-60, ⟨10.1007/3-540-44795-4_5⟩. ⟨hal-01571854⟩
64 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More