방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| K-최근접 이웃× | 다변량 분산 분석 (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데이터셋 ↗ |
|
|