Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Автокодувальник× | Факторний аналіз× | Кластеризація методом k-середніх× | Метод головних компонент× | |
|---|---|---|---|---|
| Галузь≠ | Глибоке навчання | Статистика досліджень | Машинне навчання | Машинне навчання |
| Родина≠ | Machine learning | Process / pipeline | Machine learning | Machine learning |
| Рік появи≠ | 2006 | 1931 | 1967 (formalized 1982) | 2002 |
| Автор методу≠ | Hinton, G.E. & Salakhutdinov, R.R. | Louis Leon Thurstone | MacQueen, J. B.; Lloyd, S. P. | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) |
| Тип≠ | Neural network (encoder-decoder) | Method | Partitional clustering | Unsupervised dimensionality reduction |
| Основоположне джерело≠ | Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507. DOI ↗ | Thurstone, L. L. (1947). Multiple Factor Analysis. University of Chicago Press. DOI ↗ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ |
| Інші назви≠ | Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network | EFA, CFA, latent variable modeling | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| Пов'язані≠ | 4 | 3 | 4 | 3 |
| Підсумок≠ | An autoencoder is an encoder-decoder neural network, popularised by Hinton and Salakhutdinov in 2006, that compresses data into a low-dimensional latent code and then reconstructs it, enabling dimensionality reduction and anomaly detection. By learning to rebuild its own input through a narrow bottleneck, it discovers a compact representation of the data. | 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. | K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis. | 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Набір даних ↗ |
|
|
|
|