ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Regularized LightGBM×XGBoost×
OborStrojové učeníStrojové učení
RodinaMachine learningMachine learning
Rok vzniku20172016
TvůrceKe, G. et al. (Microsoft Research)Chen, T. & Guestrin, C.
TypRegularized gradient boosting ensembleEnsemble (gradient-boosted decision trees)
Původní zdrojKe, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., & Liu, T.-Y. (2017). LightGBM: A highly efficient gradient boosting decision tree. Advances in Neural Information Processing Systems, 30, 3146–3154. link ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
Další názvyLightGBM with L1/L2 regularization, penalized LightGBM, LightGBM ridge/lasso, regularized LGBMXGBoost, extreme gradient boosting, scalable tree boosting
Příbuzné55
ShrnutíRegularized LightGBM applies L1 (lasso) and L2 (ridge) penalty terms to the leaf weight objective of LightGBM — Microsoft's highly efficient gradient boosting framework — to control model complexity, reduce overfitting, and improve generalization on tabular classification and regression tasks with high-dimensional or noisy feature sets.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.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Regularized LightGBM · XGBoost. Získáno 2026-06-17 z https://scholargate.app/cs/compare