Metraipolis › archive › dc_4f8a99d4304a
Multiple instance learning — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Multiple_instance_learning
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T00:34:27.504Z
- SHA-256 of the archived text
8d5afd5fd74acac841d0683e316fa191d4dd5d8f6431cd5a243e9e6060cbafb2- Stable URL of this page
https://metraipolis.com/documento/dc_4f8a99d4304a
How to cite
Multiple instance learning — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Multiple_instance_learning (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_4f8a99d4304a (Metraipolis archive dc_4f8a99d4304a, sha256 8d5afd5fd74acac841d0683e316fa191d4dd5d8f6431cd5a243e9e6060cbafb2)
BibTeX
@misc{dc4f8a99d4304a,
title = {Multiple instance learning — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Multiple_instance_learning},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_4f8a99d4304a; sha256 8d5afd5fd74acac841d0683e316fa191d4dd5d8f6431cd5a243e9e6060cbafb2},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Multiple_instance_learning. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In machine learning, multiple-instance learning (MIL) is a type of supervised learning. Instead of receiving a set of instances which are individually labeled, the learner receives a set of labeled bags, each containing many instances. In the simple case of multiple-instance binary classification, a bag may be labeled negative if all the instances in it are negative. On the other hand, a bag is labeled positive if there is at least one instance in it which is positive. From a collection of labeled bags, the learner tries to either (i) induce a concept that will label individual instances correctly or (ii) learn how to label bags without inducing the concept. Babenko (2008) gives a simple example for MIL. Imagine several people, and each of them has a key chain that contains few keys. Some of these people are able to enter a certain room, and some aren't. The task is then to predict whether a certain key or a certain key chain can get you into that room. To solve this problem we need to find the exact key that is common for all the "positive" key chains. If we can correctly identify this key, we can also correctly classify an entire key chain - positive if it contains the required key, or negative if it doesn't. Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; categoria «Machine learning»). Fonte: Wikipedia in inglese, voce «Multiple instance learning» — https://en.wikipedia.org/wiki/Multiple_instance_learning Wikidata Q25304516 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q25304516 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Multiple_instance_learning?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1369641806, consultata il 2026-10-05T23:46:55.438Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: be968f48a18c26607cddc0b3c22182bf22933f578de773628ed2d3bc403788be