Solving the multiple instance problem with axis-parallel rectangles
Artificial Intelligence
A framework for multiple-instance learning
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Content-Based Image Retrieval Using Multiple-Instance Learning
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Blobworld: A System for Region-Based Image Indexing and Retrieval
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
Solving the Multiple-Instance Problem: A Lazy Learning Approach
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Image Database Retrieval with Multiple-Instance Learning Techniques
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
MICCLLR: Multiple-Instance Learning Using Class Conditional Log Likelihood Ratio
DS '09 Proceedings of the 12th International Conference on Discovery Science
Hi-index | 0.00 |
Multiple-instance learning (MIL) is a variation on supervised learning, where the task is to learn a concept given positive and negative bags of instances. In this paper a novel algorithm has been introduced for multiple-instance learning. This method was inspired by both diverse density (DD) and its expectation maximization version (EM-DD). It converts MIL problem to a single-instance setting. This improved method has better accuracy and time complexity than DD and EM-DD. We apply it to drug activity prediction and image retrieval. The experiments show it has competitive accuracy values compared with other previous approaches.