方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| K-Nearest Neighbors× | 逻辑回归× | |
|---|---|---|
| 领域≠ | 机器学习 | 研究统计学 |
| 方法族≠ | Machine learning | Process / pipeline |
| 起源年份≠ | 1967 | 1958 |
| 提出者≠ | Cover, T.M. & Hart, P.E. | David Roxbee Cox |
| 类型≠ | Instance-based (non-parametric) learning | Method |
| 开创性文献≠ | Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ |
| 别名≠ | KNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learning | logit model, binomial logistic regression, LR |
| 相关≠ | 5 | 3 |
| 摘要≠ | 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. | Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science. |
| ScholarGate数据集 ↗ |
|
|