Multiple Instance Learning via Disjunctive Programming Boosting

Part of Advances in Neural Information Processing Systems 16 (NIPS 2003)

Bibtex Metadata Paper


Stuart Andrews, Thomas Hofmann


Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classiļ¬cation problems where labels are associated with sets of pattern instead of individual patterns. This encompasses multiple instance learn- ing as a special case. Our approach is based on a generalization of linear programming boosting and uses results from disjunctive programming to generate successively stronger linear relaxations of a discrete non-convex problem.