Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| SHAP (SHapley Additive exPlanations)× | Случайна гора× | |
|---|---|---|
| Област | Машинно обучение | Машинно обучение |
| Семейство | Machine learning | Machine learning |
| Година на възникване≠ | 2017 | 2001 |
| Създател≠ | Lundberg, S.M. & Lee, S.-I. | Breiman, L. |
| Тип≠ | Model-explanation method (Shapley-value attribution) | Ensemble (bagging of decision trees) |
| Основополагащ източник≠ | Lundberg, S.M. & Lee, S.-I. (2017). A Unified Approach to Interpreting Model Predictions. Advances in Neural Information Processing Systems, 30, 4766–4777. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Други названия | SHAP Değerleri (Model Açıklanabilirlik), Shapley additive explanations, SHAP values, model explainability | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Свързани≠ | 5 | 4 |
| Резюме≠ | SHAP is a model-explanation method, introduced by Scott Lundberg and Su-In Lee in 2017, that uses Shapley values from cooperative game theory to measure how much each feature contributes to an individual prediction, making the output of black-box machine-learning models interpretable. It supports both global explanations (overall feature importance) and local explanations (why one specific prediction came out the way it did). | 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Набор от данни ↗ |
|
|