paper-with-me

홈 › Papers

On the Complexity of One-class SVM for Multiple Instance Learning

2016-03-16 · Zhen Hu, Zhuyin Xue

In traditional multiple instance learning (MIL), both positive and negative bags are required to learn a prediction function. However, a high human cost is needed to know the label of each bag---positive or negative. Only positive bags contain our focus (positive instances) while negative bags consist of noise or background (negative instances). So we do not expect to spend too much to label the negative bags. Contrary to our expectation, nearly all existing MIL methods require enough negative bags besides positive ones. In this paper we propose an algorithm called "Positive Multiple Instance" (PMI), which learns a classifier given only a set of positive bags. So the annotation of negative bags becomes unnecessary in our method. PMI is constructed based on the assumption that the unknown positive instances in positive bags be similar each other and constitute one compact cluster in feature space and the negative instances locate outside this cluster. The experimental results demonstrate that PMI achieves the performances close to or a little worse than those of the traditional MIL algorithms on benchmark and real data sets. However, the number of training bags in PMI is reduced significantly compared with traditional MIL algorithms.

📄 PDF Abstract BibTeX arXiv:1603.04947

Code (0)

등록된 구현이 없습니다.

Tasks

Multiple Instance Learning

Similar Papers 제목 키워드 기반

InstanceFlow: Visualizing the Evolution of Classifier Confusion on the Instance Level

2020-07-22 · Michael Pühringer, Andreas Hinterreiter, Marc Streit

Classification is one of the most important supervised machine learning tasks. During the training of a classification model, the training instances are fed to the model multiple times (during multiple epochs) in order t…

ClassificationGeneral Classification

Adaptive Multiple-Arm Identification

2017-06-04 · ICML 2017 8 · Jiecao Chen, Xi Chen, Qin Zhang, Yuan Zhou

We study the problem of selecting $K$ arms with the highest expected rewards in a stochastic $n$-armed bandit game. This problem has a wide range of applications, e.g., A/B testing, crowdsourcing, simulation optimization…

SAC-MIL: Spatial-Aware Correlated Multiple Instance Learning for Histopathology Whole Slide Image Classification

2025-09-04 · Yu Bai, Zitong Yu, Haowen Tian, Xijing Wang 외 arxiv

We propose Spatial-Aware Correlated Multiple Instance Learning (SAC-MIL) for performing WSI classification. SAC-MIL consists of a positional encoding module to encode position information and a SAC block to perform full …

Multiple Instance LearningImage Classification

Continual Hyperbolic Learning of Instances and Classes

2025-06-12 · Melika Ayoughi, Mina Ghadimi Atigh, Mohammad Mahdi Derakhshani, Cees G. M. Snoek 외

Continual learning has traditionally focused on classifying either instances or classes, but real-world applications, such as robotics and self-driving cars, require models to handle both simultaneously. To mirror real-l…

Continual LearningObject RecognitionSelf-Driving Cars

Multi-head Attention-based Deep Multiple Instance Learning

2024-04-08 · Hassan Keshvarikhojasteh, Josien Pluim, Mitko Veta

This paper introduces MAD-MIL, a Multi-head Attention-based Deep Multiple Instance Learning model, designed for weakly supervised Whole Slide Images (WSIs) classification in digital pathology. Inspired by the multi-head …

DiversityMultiple Instance Learningwhole slide images