Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Uczenie ze wsparciem częściowym× | Półnadzorowany las losowy× | |
|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1970s–2006 (formalized) | 2009 |
| Twórca≠ | Vapnik, V. N. and others (community of researchers, 1970s–2000s) | Leistner, C., Saffari, A., Santner, J., & Bischof, H. |
| Typ≠ | Learning paradigm | Semi-supervised ensemble classifier |
| Źródło pierwotne≠ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 | Leistner, C., Saffari, A., Santner, J., & Bischof, H. (2009). Semi-supervised random forests. In Proceedings of the IEEE 12th International Conference on Computer Vision (ICCV), pp. 506–513. IEEE. DOI ↗ |
| Inne nazwy | SSL, semi-supervised machine learning, transductive learning, label-efficient learning | SSL-RF, semi-supervised forest, label-propagation random forest, self-training random forest |
| Pokrewne≠ | 5 | 3 |
| Podsumowanie≠ | 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. | Semi-supervised Random Forest (SSL-RF) extends the classic Random Forest by exploiting both labeled and unlabeled training examples. When labeling data is expensive or time-consuming, SSL-RF assigns tentative pseudo-labels to unlabeled observations through the forest itself, then retrains on the enriched dataset, progressively improving accuracy without requiring additional human annotation. |
| ScholarGateZbiór danych ↗ |
|
|