Multiple-instance learning as a classifier combining problem

Yan Li

doi:10.1016/j.patcog.2012.08.018

Return

Multiple-instance learning as a classifier combining problem

2013-03-01

PRE

DOI：10.1016/j.patcog.2012.08.018

Original

Original request for help

Save

Abstract

En 中文

In multiple-instance learning (MIL), an object is represented as a bag consisting of a set of feature vectors called instances. In the training set, the labels of bags are given, while the uncertainty comes from the unknown labels of instances in the bags. In this paper, we study MIL with the assumption that instances are drawn from a mixture distribution of the concept and the non-concept, which leads to a convenient way to solve MIL as a classifier combining problem. It is shown that instances can be classified with any standard supervised classifier by re-weighting the classification posteriors. Given the instance labels, the label of a bag can be obtained as a classifier combining problem. An optimal decision rule is derived that determines the threshold on the fraction of instances in a bag that is assigned to the concept class. We provide estimators for the two parameters in the model. The method is tested on a toy data set and various benchmark data sets, and shown to provide results comparable to state-of-the-art MIL methods. (C) 2012 Elsevier Ltd. All rights reserved.

Keywords:

Multiple instance learning

Classifier combining

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.