Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| XGBoost Boleh Dijelaskan× | Random Forest× | |
|---|---|---|
| Bidang | Pembelajaran Mesin | Pembelajaran Mesin |
| Keluarga | Machine learning | Machine learning |
| Tahun asal≠ | 2016–2020 | 2001 |
| Pengasas≠ | Chen & Guestrin (XGBoost); Lundberg & Lee (SHAP for trees) | Breiman, L. |
| Jenis≠ | Interpretable ensemble (gradient-boosted trees + SHAP) | Ensemble (bagging of decision trees) |
| Sumber perintis≠ | Lundberg, S. M., Erion, G., Chen, H., DeGrave, A., Prutkin, J. M., Nair, B., Katz, R., Himmelfarb, J., Bansal, N., & Lee, S.-I. (2020). From local explanations to global understanding with explainable AI for trees. Nature Machine Intelligence, 2(1), 56–67. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Alias | XGBoost + SHAP, interpretable XGBoost, XAI-XGBoost, transparent gradient boosting | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Berkaitan≠ | 6 | 4 |
| Ringkasan≠ | Explainable XGBoost pairs the high predictive accuracy of XGBoost gradient-boosted trees with SHAP (SHapley Additive exPlanations) values to make each prediction fully auditable. The result is a model that matches or surpasses neural networks on tabular data while offering theoretically grounded, per-prediction feature attributions that satisfy both scientific transparency and regulatory demands. | 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. |
| ScholarGateSet data ↗ |
|
|