Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Samouczenie gradientowe× | Random Forest× | |
|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 2020s | 2001 |
| Twórca≠ | Various researchers (Zhang et al. and others) | Breiman, L. |
| Typ≠ | Ensemble (self-supervised + gradient boosting) | Ensemble (bagging of decision trees) |
| Źródło pierwotne≠ | Zhang, Y., Zhang, J., & Yang, Q. (2022). Self-Supervised Gradient Boosting for Semi-Supervised Learning on Tabular Data. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Inne nazwy | SSL gradient boosting, self-supervised boosting, semi-supervised gradient boosting, SSL-GBM | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Pokrewne≠ | 5 | 4 |
| Podsumowanie≠ | Self-supervised gradient boosting extends the classic gradient boosting framework by incorporating self-supervised pretext tasks to exploit unlabeled data. The model first learns useful feature representations from unannotated samples, then uses those representations to guide the sequential ensemble of weak learners, achieving strong predictive performance even when labeled examples are scarce. | 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. |
| ScholarGateZbiór danych ↗ |
|
|