Papers with Code · CC BY-SA 4.0

Multiple Instance Learning

28 평가 기록 5 datasets

Multiple Instance Learning is a type of weakly supervised learning algorithm where training data is arranged in bags, where each bag contains a set of instances $X=\\{x_1,x_2, \ldots,x_M\\}$, and there is one single label $Y$ per bag, $Y\in\\{0, 1\\}$ in the case of a binary classification problem. It is assumed that individual labels $y_1, y_2,\ldots, y_M$ exist for the instances within a bag, but they are unknown during training. In the standard Multiple Instance assumption, a bag is considered negative if all its instances are negative. On the other hand, a bag is positive, if at least one instance in the bag is positive.

<span class="description-source">Source: Monte-Carlo Sampling applied to Multiple Instance Learning for Histological Image Classification </span>

개요는 각 항목의 일부입니다. 위 탭에서 전체 기록을 페이지별로 탐색할 수 있습니다.

벤치마크

Papers with Code 아카이브의 데이터셋별 기록 예시입니다. 평가 조건과 지표 방향이 검증되지 않아 순위를 의미하지 않습니다.

Dataset기록된 모델 예시MetricPaperCode
Snuffy (DINO Exhaustive)
AUC: 0.987ACC: 0.948Expected Calibration Error: 0.083Patch AUC: 0.957
논문 코드
DTFD-MIL (AFS)
ACC: 0.951
논문 코드
Snuffy
ACC: 0.923AUC: 0.967
논문 코드
Snuffy
AUC: 0.989ACC: 0.961
논문 코드
DSMIL
ACC: 0.934
논문 코드

데이터셋

5개

논문

라이브러리

Papers with Code 리더보드 row에 연결된 구현 저장소입니다.