Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Învățare Activă bazată pe Ansambluri× | Învățare semi-supervizată× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1992 | 1970s–2006 (formalized) |
| Autorul original≠ | Seung, H. S., Opper, M., & Sompolinsky, H. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| Tip≠ | Ensemble-based active learning strategy | Learning paradigm |
| Sursa seminală≠ | Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (COLT 1992), pp. 287–294. ACM. link ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| Denumiri alternative | Query by Committee, QBC active learning, committee-based active learning, ensemble query strategy | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| Înrudite | 5 | 5 |
| Rezumat≠ | Ensemble Active Learning combines a committee of diverse models with an active learning loop to select the most informative unlabeled examples for labeling. Rooted in the Query by Committee framework introduced by Seung et al. (1992), it uses disagreement among committee members as a signal for uncertainty, reducing the number of labeled examples needed to achieve strong predictive performance. | Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained. |
| ScholarGateSet de date ↗ |
|
|