Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Balsojošā kopas aktīvā apguve× | Daudzpusīgā apguve× | |
|---|---|---|
| Nozare | Mašīnmācīšanās | Mašīnmācīšanās |
| Saime | Machine learning | Machine learning |
| Izcelsmes gads≠ | 1992 | 1970s–2006 (formalized) |
| Autors≠ | Seung, H. S., Opper, M., & Sompolinsky, H. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| Tips≠ | Active learning with ensemble voting | Learning paradigm |
| Pirmavots≠ | Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory (COLT '92), pp. 287–294. ACM. DOI ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| Citi nosaukumi | Query by Committee, QBC, active ensemble learning, committee-based active learning | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| Saistītās | 5 | 5 |
| Kopsavilkums≠ | Active Learning Voting Ensemble — formally known as Query by Committee — is an active learning strategy that trains a committee of diverse models and selects the unlabeled examples where the committee members disagree most for human annotation. By focusing labeling effort on the most informative points, it achieves high accuracy with far fewer labeled examples than passive learning requires. | 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. |
| ScholarGateDatu kopa ↗ |
|
|