ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

线性判别分析 (LDA×K-Nearest Neighbors×多元方差分析 (MANOVA)×
领域统计学机器学习统计学
方法族Hypothesis testMachine learningHypothesis test
起源年份193619671932
提出者Ronald A. FisherCover, T.M. & Hart, P.E.Samuel Stanley Wilks (Wilks' Lambda, 1932); Roy, Hotelling, Pillai (mid-20th c.)
类型Parametric linear classifier / dimensionality reductionInstance-based (non-parametric) learningParametric multivariate mean comparison
开创性文献Fisher, R.A. (1936). The Use of Multiple Measurements in Taxonomic Problems. Annals of Eugenics, 7(2), 179–188. DOI ↗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
别名LDA, Fisher's LDA, Fisher's linear discriminant, discriminant function analysisKNN, K-En Yakın Komşu (KNN), nearest neighbor classifier, instance-based learningMultivariate ANOVA, Çok Değişkenli ANOVA (MANOVA)
相关755
摘要Linear Discriminant Analysis (LDA) is a parametric supervised classification method that finds the linear combination of continuous predictors that best separates two or more predefined groups. Introduced by Ronald A. Fisher in his landmark 1936 paper on taxonomic measurements, it simultaneously serves as a classifier and a dimensionality-reduction tool, and can be understood as the classification-oriented counterpart of MANOVA.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数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Linear Discriminant Analysis (Classification) · K-Nearest Neighbors · MANOVA. 于 2026-06-18 检索自 https://scholargate.app/zh/compare