השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| ניתוח גורמים× | מודל תערובת גאוסיאנית× | |
|---|---|---|
| תחום≠ | סטטיסטיקה למחקר | למידת מכונה |
| משפחה≠ | Process / pipeline | Machine learning |
| שנת המקור≠ | 1931 | 1977 |
| הוגה השיטה≠ | Louis Leon Thurstone | Dempster, Laird & Rubin (EM algorithm) |
| סוג≠ | Method | Probabilistic (soft) clustering — mixture model |
| מקור מכונן≠ | Thurstone, L. L. (1947). Multiple Factor Analysis. University of Chicago Press. 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 ↗ |
| כינויים≠ | EFA, CFA, latent variable modeling | Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians |
| קשורות≠ | 3 | 4 |
| תקציר≠ | Factor analysis is a statistical technique for identifying latent (unobserved) dimensions underlying observed variables, developed by Louis Leon Thurstone in the 1930s and formalized by Jöreskog (1969). Exploratory factor analysis (EFA) discovers unknown factor structure from data; confirmatory factor analysis (CFA) tests hypothesized relationships between observed and latent variables. Essential in psychometrics (test development), organizational research (measuring constructs like leadership style), and biomedicine (identifying disease subtypes), factor analysis reduces dimensionality while revealing conceptual organization in multivariate data. | 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. |
| ScholarGateמערך נתונים ↗ |
|
|