ScholarGate
Assistente

Confronta i metodi

Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.

Albero decisionale×Modello di Miscela Gaussiana×Analisi delle Componenti Principali×
CampoApprendimento automaticoApprendimento automaticoApprendimento automatico
FamigliaMachine learningMachine learningMachine learning
Anno di origine198419772002
IdeatoreBreiman, Friedman, Olshen & StoneDempster, Laird & Rubin (EM algorithm)Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
TipoRecursive partitioning (if-then rules)Probabilistic (soft) clustering — mixture modelUnsupervised dimensionality reduction
Fonte seminaleBreiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. 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 ↗
AliasKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of GaussiansTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
Correlati543
SintesiA Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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.
ScholarGateInsieme di dati
  1. v1
  2. 1 Fonti
  3. PUBLISHED
  1. v1
  2. 1 Fonti
  3. PUBLISHED
  1. v1
  2. 1 Fonti
  3. PUBLISHED

Vai alla ricerca Scarica le diapositive

ScholarGateConfronta i metodi: Decision Tree · Gaussian Mixture Model · Principal Component Analysis. Consultato il 2026-06-18 da https://scholargate.app/it/compare