A maximum-margin multisphere approach for binary Multiple Instance Learning

Abstract

We propose a heuristic approach for solving binary Multiple Instance Learning (MIL) problems, whose objective is to categorize bags of instances. Considering the case with two classes of instances, on the basis of the standard MIL assumption, a bag is classified positive if it contains at least a positive instance and negative if all its instances are negative. Inspired by a well-established MIL Support Vector Machine type approach, our technique is based on iteratively separating the bags by means of successive maximum-margin spheres. Such spheres, whose number is automatically determined, are generated by computing, for each of them, the optimal radius in correspondence to a prefixed center. Numerical results are presented on a set of benchmark test problems, showing the effectiveness of our approach.