Multi-instance tree learning

  • Authors:
  • Hendrik Blockeel;David Page;Ashwin Srinivasan

  • Affiliations:
  • Katholieke Universiteit Leuven, Celestijnenlaan, Leuven, Belgium;University of Wisconsin, Madison, WI;Indian Institute of Technology, Hauz Khas, New Delhi, India

  • Venue:
  • ICML '05 Proceedings of the 22nd international conference on Machine learning
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce a novel algorithm for decision tree learning in the multi-instance setting as originally defined by Dietterich et al. It differs from existing multi-instance tree learners in a few crucial, well-motivated details. Experiments on synthetic and real-life datasets confirm the beneficial effect of these differences and show that the resulting system outperforms the existing multi-instance decision tree learners.