Multiple Instance Learning
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 5
- 보존된 평가 기록
- 28
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.
Source: Monte-Carlo Sampling applied to Multiple Instance Learning for Histological Image Classification
하위 태스크
해결할 문제를 선택하세요. 같은 이름의 태스크는 상위 분야와 평가 조건으로 구분합니다.
더 세분화된 태스크가 없습니다.
관련 논문 살펴보기 →출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.