ScholarGate
Asistent

Porovnat metody

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

Elastic Net×Random Forest×
OborStrojové učeníStrojové učení
RodinaMachine learningMachine learning
Rok vzniku20052001
TvůrceZou, H. & Hastie, T.Breiman, L.
TypRegularized linear regression (L1 + L2 penalty)Ensemble (bagging of decision trees)
Původní zdrojZou, H. & Hastie, T. (2005). Regularization and Variable Selection via the Elastic Net. Journal of the Royal Statistical Society: Series B, 67(2), 301–320. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
Další názvyElastic Net Regresyon, elastic net regression, ElasticNet, L1/L2 regularized regressionRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Příbuzné44
ShrnutíElastic Net is a regularized linear regression method introduced by Zou and Hastie in 2005 that blends the LASSO (L1) and Ridge (L2) penalties, so it performs variable selection and coefficient shrinkage at the same time. It is designed for predictive and explanatory modelling on data with many, possibly correlated, predictors.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.
ScholarGateDatová sada
  1. v1
  2. 1 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

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

ScholarGatePorovnat metody: Elastic Net · Random Forest. Získáno 2026-06-17 z https://scholargate.app/cs/compare