.png){kind=icon}
返回
Multiple-instance Learning from Triplet Comparison Bags
.png){kind=icon}
PRE
AI
DOI：10.1145/3638776.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multiple-instance learning (MIL) solves the problemwhere training instances are grouped in bags, and a binary (positive or negative) label is provided for each bag. Most of the existing MIL studies need fully labeled bags for training an effective classifier, while it could be quite hard to collect such data in many real-world scenarios, due to the high cost of data labeling process. Fortunately, unlike fully labeled data, triplet comparison data can be collected in a more accurate and human-friendly way. Therefore, in this article, we for the first time investigate MIL from only triplet comparison bags, where a triplet (Xa, Xb, Xc) contains the weak supervision information that bag Xa is more similar to Xb than to Xc. To solve this problem, we propose to train a bag-level classifier by the empirical risk minimization framework and theoretically provide a generalization error bound. We also show that a convex formulation can be obtained only when specific convex binary losses such as the square loss and the double hinge loss are used. Extensive experiments validate that our proposed method significantly outperforms other baselines.
Keyword:
Multi-Instance Learning
Triplet Comparison
Empirical Risk Minimization
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
Petrography, strontium, barium and uranium concentrations, and strontium and uranium isotope ratios in speleothems as palaeoclimatic proxies: Soreq Cave, Israel.png)
The Holocene
The HoloceneIF0
PREAI
分享收藏Multiple instance learning: A survey of problem characteristics and applications多实例学习: 问题特征与应用综述PATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏
查看更多内容