विधियों की तुलना करें

	व्याख्यायोग्य ग्रेडिएंट बूस्टिंग	ग्रेडिएंट बूस्टिंग
क्षेत्र	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	2017–2020	2001
प्रवर्तक	Lundberg, S. M. & Lee, S.-I. (TreeSHAP for tree ensembles)	Friedman, J. H.
प्रकार	Ensemble + explainability layer	Ensemble (sequential boosting 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.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
उपनाम	XGB with SHAP, interpretable gradient boosting, transparent gradient boosting, XAI gradient boosting	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
संबंधित	6	5
सारांश	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.	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.