Uboreshaji wa Gradient Ulioimarishwa
Uboreshaji wa gradient ulioimarishwa unapanua mkusanyiko wa miti ya nyongeza ya kawaida (Friedman 2001) kwa kuingiza vipengele vya adhabu vya L1 na L2 moja kwa moja kwenye lengo la mafunzo, pamoja na adhabu ya ugumu wa ukubwa wa mti. Umaarufu wake ulioimarishwa na XGBoost (Chen & Guestrin 2016), mfumo huu unapunguza upakiaji kupita kiasi na kuboresha uhalali ikilinganishwa na uboreshaji usio na adhabu, huku ukidumisha usahihi wa tabia wa mbinu kwenye data ya jedwali.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
+2 more
Vyanzo
- 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 ↗
- Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI: 10.1214/aos/1013203451 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Regularized Gradient Boosting (L1/L2-Penalized Additive Tree Ensemble). ScholarGate. https://scholargate.app/sw/machine-learning/regularized-gradient-boosting
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.
- KuimarishaUjifunzaji wa Mashine↔ compare
- Uimarishaji wa MteremkoUjifunzaji wa Mashine↔ compare
- LightGBMUjifunzaji wa Mashine↔ compare
- Regularized Decision TreeUjifunzaji wa Mashine↔ compare
- Msitu wa Kawaida wa BahatishaUjifunzaji wa Mashine↔ compare
- XGBoostUjifunzaji wa Mashine↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →