方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| K-Nearest Neighbors× | 多元方差分析 (MANOVA)× | |
|---|---|---|
| 领域≠ | 机器学习 | 统计学 |
| 方法族≠ | Machine learning | Hypothesis test |
| 起源年份≠ | 1967 | 1932 |
| 提出者≠ | Cover, T.M. & Hart, P.E. | Samuel Stanley Wilks (Wilks' Lambda, 1932); Roy, Hotelling, Pillai (mid-20th c.) |
| 类型≠ | Instance-based (non-parametric) learning | Parametric multivariate mean comparison |
| 开创性文献≠ | Cover, T.M. & Hart, P.E. (1967). Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), 21–27. DOI ↗ | Tabachnick, B.G. & Fidell, L.S. (2013). Using Multivariate Statistics (6th ed.). Pearson. ISBN: 978-0205849574 |
| 别名≠ | KNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learning | Multivariate ANOVA, Çok Değişkenli ANOVA (MANOVA) |
| 相关 | 5 | 5 |
| 摘要≠ | 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. | MANOVA is a parametric hypothesis test that simultaneously compares group means across multiple continuous dependent variables, controlling the inflation of Type I error that would result from running separate ANOVAs. Key multivariate test statistics — Wilks' Lambda, Pillai's Trace, Hotelling-Lawley Trace, and Roy's Greatest Root — were developed between the 1930s and 1950s, with Wilks' Lambda formalised by Samuel Stanley Wilks in 1932. |
| ScholarGate数据集 ↗ |
|
|