Multiple-Instance Learning with Instance Selection via Dominant Sets

Erdem A., ERDEM M. E.

1st International Workshop on Similarity-Based Pattern Recognition (SIMBAD), Venice, Italy, 28 - 30 September 2011, vol.7005, pp.177-191 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 7005
  • Doi Number: 10.1007/978-3-642-24471-1_13
  • City: Venice
  • Country: Italy
  • Page Numbers: pp.177-191


Multiple-instance learning (MIL) deals with learning under ambiguity, in which patterns to be classified are described by bags of instances. There has been a growing interest in the design and use of MIL algorithms as it provides a natural framework to solve a wide variety of pattern recognition problems. In this paper, we address MIL from a view that transforms the problem into a standard supervised learning problem via instance selection. The novelty of the proposed approach comes from its selection strategy to identify the most representative examples in the positive and negative training bags, which is based on an effective pairwise clustering algorithm referred to as dominant sets. Experimental results on both standard benchmark data sets and on multi-class image classification problems show that the proposed approach is not only highly competitive with state-of-the-art MIL algorithms but also very robust to outliers and noise.