ON GENERALIZED MULTIPLE-INSTANCE LEARNING
Abstract
We describe a generalisation of the multiple-instance learning model in which a bag's label is not based on a single instance's proximity to a single target point. Rather, a bag is positive if and only if it contains a collection of instances, each near one of a set of target points. We then adapt a learning-theoretic algorithm for learning in this model and present empirical results on data from robot vision, content-based image retrieval, and protein sequence identification.
A more detailed, preliminary version of this paper appears as technical report UNL-CSE-2003-5, Department of Computer Science, University of Nebraska (2003).
Remember to check out the Most Cited Articles! |
---|
Check out these titles in artificial intelligence! |