مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| درختان فوقالعاده قابل توضیح× | گرادیان بوستینگ (Gradient Boosting)× | |
|---|---|---|
| حوزه | یادگیری ماشین | یادگیری ماشین |
| خانواده | Machine learning | Machine learning |
| سال پیدایش≠ | 2006 (Extra Trees); 2017 (SHAP integration) | 2001 |
| پدیدآور≠ | Geurts, P., Ernst, D., Wehenkel, L. (Extra Trees); Lundberg, S. M. (SHAP explainability layer) | Friedman, J. H. |
| نوع≠ | Ensemble (randomized trees) with post-hoc explainability | Ensemble (sequential boosting of decision trees) |
| منبع بنیادین≠ | Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| نامهای دیگر | XAI-ET, Explainable ET, Interpretable Extra Trees, Extra Trees with SHAP | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| مرتبط | 5 | 5 |
| خلاصه≠ | Explainable Extra Trees combines the Extremely Randomized Trees (Extra Trees) ensemble algorithm with post-hoc explainability methods — most commonly SHAP values — to deliver both strong predictive performance and transparent, feature-level explanations. It extends the classic Extra Trees classifier or regressor so that every prediction can be decomposed into individual feature contributions, satisfying demands for accountability in applied and regulated domains. | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. |
| ScholarGateمجموعهداده ↗ |
|
|