So sánh phương pháp

	k-Hàng xóm gần nhất có điều chuẩn hóa	Máy học vector hỗ trợ có điều chuẩn (Regularized Support Vector Machine)
Lĩnh vực	Học máy	Học máy
Họ	Machine learning	Machine learning
Năm ra đời	1967–2000s	1995–2004
Người khởi xướng	Extends Cover & Hart (1967); regularization formulations developed through kernel smoothing literature	Cortes, C. & Vapnik, V. (soft-margin SVM); Zhu et al. (L1-SVM)
Loại	Instance-based / lazy learner with regularization	Regularized discriminative classifier / regressor
Công trình gốc	Cover, T. & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1), 21–27.	Cortes, C. & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273–297.
Tên gọi khác	regularized kNN, kernel-weighted kNN, distance-regularized nearest neighbors, kNN with regularization	Regularized SVM, L1-SVM, L2-SVM, penalized SVM
Liên quan	4	4
Tóm tắt	Regularized k-Nearest Neighbors (kNN) extends the classical nearest-neighbor algorithm by incorporating regularization mechanisms — most commonly kernel-based distance weighting or bandwidth control — that smooth predictions, reduce sensitivity to the choice of k, and lower variance. The result is a more stable and better-calibrated instance-based learner for classification and regression tasks on tabular data.	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.