So sánh phương pháp

	Máy học vector hỗ trợ có điều chuẩn (Regularized Support Vector Machine)	Hồi quy tuyến tính chính quy hóa
Lĩnh vực	Học máy	Học máy
Họ	Machine learning	Machine learning
Năm ra đời	1995–2004	1970–2005
Người khởi xướng	Cortes, C. & Vapnik, V. (soft-margin SVM); Zhu et al. (L1-SVM)	Hoerl & Kennard (Ridge, 1970); Tibshirani (Lasso, 1996); Zou & Hastie (Elastic Net, 2005)
Loại	Regularized discriminative classifier / regressor	Penalized linear model
Công trình gốc	Cortes, C. & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273–297.	Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288.
Tên gọi khác	Regularized SVM, L1-SVM, L2-SVM, penalized SVM	Ridge regression, Lasso regression, Elastic Net regression, penalized regression
Liên quan	4	4
Tóm tắt	Regularized Support Vector Machine extends the classic SVM by explicitly controlling the trade-off between margin maximization and training error through an L1 or L2 penalty parameter. The soft-margin formulation introduced by Cortes and Vapnik in 1995 is itself a regularized model, and later L1-SVM variants additionally promote feature sparsity, enabling automatic variable selection in high-dimensional settings.	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.