ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

Hierarkisk klustring×Linjär diskriminantanalys (LDA×
ÄmnesområdeMaskininlärningStatistik
FamiljMachine learningHypothesis test
Ursprungsår19631936
UpphovspersonWard, J. H.Ronald A. Fisher
TypUnsupervised clustering (agglomerative)Parametric linear classifier / dimensionality reduction
UrsprungskällaWard, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗Fisher, R.A. (1936). The Use of Multiple Measurements in Taxonomic Problems. Annals of Eugenics, 7(2), 179–188. DOI ↗
AliasHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringLDA, Fisher's LDA, Fisher's linear discriminant, discriminant function analysis
Närliggande47
SammanfattningHierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.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.
ScholarGateDatamängd
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: Hierarchical Clustering · Linear Discriminant Analysis (Classification). Hämtad 2026-06-19 från https://scholargate.app/sv/compare