ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Объяснимый градиентный бустинг×Случайный лес×
ОбластьМашинное обучениеМашинное обучение
СемействоMachine learningMachine learning
Год появления2017–20202001
Автор методаLundberg, S. M. & Lee, S.-I. (TreeSHAP for tree ensembles)Breiman, L.
ТипEnsemble + explainability layerEnsemble (bagging of decision trees)
Основополагающий источник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, 56–67. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Другие названияXGB with SHAP, interpretable gradient boosting, transparent gradient boosting, XAI gradient boostingRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Связанные64
СводкаExplainable Gradient Boosting combines the predictive power of gradient boosting ensembles with structured interpretability tools — principally SHAP (SHapley Additive exPlanations) — to produce models that are both highly accurate and transparently auditable. Practitioners obtain global feature rankings and individual-level explanations alongside standard performance metrics.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Набор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Explainable Gradient Boosting · Random Forest. Получено 2026-06-15 из https://scholargate.app/ru/compare