Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Lasso-регресія× | Випадковий ліс× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1996 | 2001 |
| Автор методу≠ | Tibshirani, R. | Breiman, L. |
| Тип≠ | Regularized linear regression (L1 penalty) | Ensemble (bagging of decision trees) |
| Основоположне джерело≠ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Інші назви | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Пов'язані | 4 | 4 |
| Підсумок≠ | Lasso regression, introduced by Robert Tibshirani in 1996, is a linear regression method that adds an L1 penalty to the loss so that it shrinks coefficients and performs variable selection at the same time, producing a sparse model. By driving some coefficients exactly to zero it keeps only the predictors that matter. | 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. |
| ScholarGateНабір даних ↗ |
|
|