Jämför metoder

	Semi-supervised linjär regression	Regulariserad linjär regression
Ämnesområde	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning
Ursprungsår	2005–2006	1970–2005
Upphovsperson	Chapelle, O.; Scholkopf, B.; Zien, A. (seminal synthesis); Zhou & Li (co-training formulation)	Hoerl & Kennard (Ridge, 1970); Tibshirani (Lasso, 1996); Zou & Hastie (Elastic Net, 2005)
Typ	Semi-supervised regression model	Penalized linear model
Ursprungskälla	Chapelle, O., Scholkopf, B., & Zien, A. (Eds.). (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9	Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288.
Alias	SSL linear regression, semi-supervised least squares, transductive linear regression, label-efficient linear regression	Ridge regression, Lasso regression, Elastic Net regression, penalized regression
Närliggande	4	4
Sammanfattning	Semi-supervised linear regression fits a linear model on a small labeled dataset and then leverages a larger pool of unlabeled observations to improve coefficient estimates and generalization. By generating pseudo-labels for unlabeled points and iteratively refining the model, it achieves better predictive accuracy than a purely supervised linear model trained on scarce labels alone.	Regularized linear regression adds a penalty term to the ordinary least-squares objective, shrinking or zeroing out coefficients to reduce overfitting and handle multicollinearity. The three main variants — Ridge (L2 penalty), Lasso (L1 penalty), and Elastic Net (combined L1+L2) — make linear regression usable even when features outnumber observations or predictors are highly correlated.