ScholarGate
助手

方法对比

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

K-Means聚类×线性判别分析 (LDA×
领域机器学习统计学
方法族Machine learningHypothesis test
起源年份19671936
提出者MacQueen, J.Ronald A. Fisher
类型Partitional clustering (centroid-based)Parametric linear classifier / dimensionality reduction
开创性文献MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗Fisher, R.A. (1936). The Use of Multiple Measurements in Taxonomic Problems. Annals of Eugenics, 7(2), 179–188. DOI ↗
别名K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clusteringLDA, Fisher's LDA, Fisher's linear discriminant, discriminant function analysis
相关37
摘要K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.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.
ScholarGate数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

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