ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

Explainable Random Forest×그래디언트 부스팅×XGBoost×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도2001–201720012016
창시자Breiman, L. (RF); Lundberg & Lee (SHAP attribution)Friedman, J. H.Chen, T. & Guestrin, C.
유형Interpretable ensemble (bagging + post-hoc attribution)Ensemble (sequential boosting of decision trees)Ensemble (gradient-boosted decision trees)
원전Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774. link ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
별칭XRF, interpretable random forest, transparent random forest, random forest with explainabilityGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineXGBoost, extreme gradient boosting, scalable tree boosting
관련455
요약Explainable Random Forest (XRF) combines the predictive power of Breiman's Random Forest ensemble with systematic post-hoc attribution methods — principally SHAP values and mean-decrease-in-impurity importance — to make model decisions transparent and auditable. It delivers both high accuracy and human-interpretable feature contributions, satisfying demands from regulators, domain experts, and academic reviewers alike.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.XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Explainable Random Forest · Gradient Boosting · XGBoost. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare