ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Иерархическая кластеризация×Модель гауссовских смесей×Анализ главных компонент×
ОбластьМашинное обучениеМашинное обучениеМашинное обучение
СемействоMachine learningMachine learningMachine learning
Год появления196319772002
Автор методаWard, J. H.Dempster, Laird & Rubin (EM algorithm)Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
ТипUnsupervised clustering (agglomerative)Probabilistic (soft) clustering — mixture modelUnsupervised dimensionality reduction
Основополагающий источникWard, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗Dempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–22. DOI ↗Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗
Другие названияHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringGaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of GaussiansTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
Связанные443
СводкаHierarchical 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.A Gaussian Mixture Model is a probabilistic clustering method that models the data as a weighted mixture of several Gaussian distributions, fitted with the Expectation–Maximization algorithm formalized by Dempster, Laird & Rubin in 1977. It is a generalization of K-means in which each cluster can take its own shape, size, and orientation.Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures.
ScholarGateНабор данных
  1. v1
  2. 1 Источники
  3. PUBLISHED
  1. v1
  2. 1 Источники
  3. PUBLISHED
  1. v1
  2. 1 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Hierarchical Clustering · Gaussian Mixture Model · Principal Component Analysis. Получено 2026-06-18 из https://scholargate.app/ru/compare