方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| K-Nearest Neighbors× | Lasso 回归× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1967 | 1996 |
| 提出者≠ | Cover, T.M. & Hart, P.E. | Tibshirani, R. |
| 类型≠ | Instance-based (non-parametric) learning | Regularized linear regression (L1 penalty) |
| 开创性文献≠ | Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ |
| 别名 | KNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learning | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| 相关≠ | 5 | 4 |
| 摘要≠ | K-Nearest Neighbors (KNN), formalized by Cover and Hart in 1967, is a non-parametric, instance-based method that classifies or predicts a new observation by looking at the k closest examples in the training data. For classification it takes a majority vote among those neighbors; for regression it averages their values. | 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. |
| ScholarGate数据集 ↗ |
|
|