Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Arbre de décision× | Modèle de mélange gaussien× | Analyse en composantes principales× | |
|---|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning | Machine learning |
| Année d'origine≠ | 1984 | 1977 | 2002 |
| Auteur d'origine≠ | Breiman, Friedman, Olshen & Stone | Dempster, Laird & Rubin (EM algorithm) | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) |
| Type≠ | Recursive partitioning (if-then rules) | Probabilistic (soft) clustering — mixture model | Unsupervised dimensionality reduction |
| Source fondatrice≠ | Breiman, 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 ↗ |
| Alias≠ | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| Apparentées≠ | 5 | 4 | 3 |
| Résumé≠ | A 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. |
| ScholarGateJeu de données ↗ |
|
|
|