Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Regresie Liniară Online× | Regresia Ridge× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1960 (LMS); 1950 (RLS formalization) | 1970 |
| Autorul original≠ | Widrow, B. & Hoff, M. E. (LMS); Gauss / Plackett (RLS) | Hoerl, A.E. & Kennard, R.W. |
| Tip≠ | Incremental supervised regression | L2-regularized linear regression |
| Sursa seminală≠ | Shalev-Shwartz, S. (2012). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ | Hoerl, A.E. & Kennard, R.W. (1970). Ridge Regression: Biased Estimation for Nonorthogonal Problems. Technometrics, 12(1), 55–67. DOI ↗ |
| Denumiri alternative | incremental linear regression, streaming linear regression, recursive least squares regression, stochastic gradient descent regression | Ridge Regresyonu, ridge regresyonu, L2-regularized regression, Tikhonov regularization |
| Înrudite≠ | 6 | 4 |
| Rezumat≠ | Online Linear Regression fits a linear model one observation at a time, updating weights incrementally as each new data point arrives. Unlike batch least-squares, it never needs to store or re-process the full dataset, making it the natural choice for streaming data, very large datasets, and environments where the data-generating process can shift over time. | Ridge Regression is an L2-regularized linear regression method, introduced by Arthur Hoerl and Robert Kennard in 1970, that reduces multicollinearity by adding a penalty on the size of the coefficients. It shrinks coefficients toward zero without setting any of them exactly to zero, producing more stable estimates when predictors are highly correlated. |
| ScholarGateSet de date ↗ |
|
|