Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Случайна гора× | Полу-наблюдавано обучение× | |
|---|---|---|
| Област | Машинно обучение | Машинно обучение |
| Семейство | Machine learning | Machine learning |
| Година на възникване≠ | 2001 | 1970s–2006 (formalized) |
| Създател≠ | Breiman, L. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| Тип≠ | Ensemble (bagging of decision trees) | Learning paradigm |
| Основополагащ източник≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| Други названия | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| Свързани≠ | 4 | 5 |
| Резюме≠ | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. | 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. |
| ScholarGateНабор от данни ↗ |
|
|