ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Regroupement par K-moyennes×Analyse Discriminante Linéaire (ADL×
DomaineApprentissage automatiqueStatistique
FamilleMachine learningHypothesis test
Année d'origine19671936
Auteur d'origineMacQueen, J.Ronald A. Fisher
TypePartitional clustering (centroid-based)Parametric linear classifier / dimensionality reduction
Source fondatriceMacQueen, 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 ↗
AliasK-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clusteringLDA, Fisher's LDA, Fisher's linear discriminant, discriminant function analysis
Apparentées37
Résumé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.
ScholarGateJeu de données
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: K-Means Clustering · Linear Discriminant Analysis (Classification). Consulté le 2026-06-17 sur https://scholargate.app/fr/compare