השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| XGBoost חצי-מפוקח× | יער אקראי× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 2016–2018 | 2001 |
| הוגה השיטה≠ | Chen, T. & Guestrin, C. (XGBoost); semi-supervised extension by multiple authors | Breiman, L. |
| סוג≠ | Ensemble (semi-supervised gradient boosting) | Ensemble (bagging of decision trees) |
| מקור מכונן≠ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| כינויים | SS-XGBoost, semi-supervised gradient boosting, pseudo-label XGBoost, label-propagation XGBoost | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| קשורות | 4 | 4 |
| תקציר≠ | Semi-supervised XGBoost extends the XGBoost gradient boosting framework to settings where only a fraction of training examples carry labels. By iteratively generating pseudo-labels for unlabeled data and retraining on the expanded set, the method extracts signal from unlabeled observations, improving generalization when labeled data 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. |
| ScholarGateמערך נתונים ↗ |
|
|