Solving multi-instance problems with classifier ensemble based on constructive clustering

  • Authors:
  • Zhi-Hua Zhou;Min-Ling Zhang

  • Affiliations:
  • Nanjing University, National Laboratory for Novel Software Technology, 210093, Nanjing, China;Nanjing University, National Laboratory for Novel Software Technology, 210093, Nanjing, China

  • Venue:
  • Knowledge and Information Systems - Special Issue on Mining Low-Quality Data
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In multi-instance learning, the training set is composed of labeled bags each consists of many unlabeled instances, that is, an object is represented by a set of feature vectors instead of only one feature vector. Most current multi-instance learning algorithms work through adapting single-instance learning algorithms to the multi-instance representation, while this paper proposes a new solution which goes at an opposite way, that is, adapting the multi-instance representation to single-instance learning algorithms. In detail, the instances of all the bags are collected together and clustered into d groups first. Each bag is then re-represented by d binary features, where the value of the ith feature is set to one if the concerned bag has instances falling into the ith group and zero otherwise. Thus, each bag is represented by one feature vector so that single-instance classifiers can be used to distinguish different classes of bags. Through repeating the above process with different values of d, many classifiers can be generated and then they can be combined into an ensemble for prediction. Experiments show that the proposed method works well on standard as well as generalized multi-instance problems.