ScholarGate
Asisten
Machine learningMachine learning

LightGBM Regularisasi

LightGBM Regularisasi menerapkan suku penalti L1 (lasso) dan L2 (ridge) pada tujuan bobot daun (leaf weight objective) dari LightGBM — kerangka kerja gradient boosting yang sangat efisien dari Microsoft — untuk mengontrol kompleksitas model, mengurangi overfitting, dan meningkatkan generalisasi pada tugas klasifikasi dan regresi tabular dengan set fitur berdimensi tinggi atau berisik.

Buka di MethodMindSegeraVideoSegeraDownload slides

Baca metode selengkapnya

Khusus anggota

Masuk dengan akun gratis untuk membaca bagian ini.

Masuk

Method map

The neighbourhood of related methods — select a node to explore.

Sumber

  1. Ke, 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
  2. Chen, T., & Guestrin, C. (2016). XGBoost: A scalable tree boosting system. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 785–794. DOI: 10.1145/2939672.2939785

Cara menyitasi halaman ini

ScholarGate. (2026, June 3). Regularized Light Gradient Boosting Machine. ScholarGate. https://scholargate.app/id/machine-learning/regularized-lightgbm

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Dirujuk oleh

ScholarGateRegularized LightGBM (Regularized Light Gradient Boosting Machine). Diakses 2026-06-15 dari https://scholargate.app/id/machine-learning/regularized-lightgbm · Set data: https://doi.org/10.5281/zenodo.20539026