.png){kind=icon}
Return
Multiple-Instance Learning from Pairwise Comparison Bags
.png){kind=icon}
PRE
AI
DOI：10.1145/3696460.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multiple-instance learning (MIL) is a significant weakly supervised learning problem, where the training data consist of bags containing multiple instances and bag-level labels. Most previous MIL research required fully labeled bags. However, collecting such data is challenging due to the labeling costs or privacy concerns. Fortunately, we can easily collect pairwise comparison information, indicating one bag is more likely to be positive than the other. Therefore, we investigate a novel MIL problem about learning a bag-level binary classifier only from pairwise comparison bags. To solve this problem, we display the data generation process and provide a baseline method to train an instance-level classifier based on unlabeled-unlabeled learning. To achieve better performance, we propose a convex formulation to train a bag-level classifier and give a generalization error bound. Comprehensive experiments show that both the baseline method and the convex formulation achieve satisfactory performance, while the convex formulation performs better.1
Keywords:
multiple-instance learning
empirical risk minimization
convex formulation
Journal
IF:
6.6
Papers:
1.5K
Citations:
6.2K
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveMultiple instance learning: A survey of problem characteristics and applications.png)
PATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAIShareSave
View more