Vertaile menetelmiä

	Autoenkooderi	Faktorianalyysi	K-means-klusterointi
Tieteenala	Syväoppiminen	Tutkimuksen tilastomenetelmät	Koneoppiminen
Menetelmäperhe	Machine learning	Process / pipeline	Machine learning
Syntyvuosi	2006	1931	1967 (formalized 1982)
Kehittäjä	Hinton, G.E. & Salakhutdinov, R.R.	Louis Leon Thurstone	MacQueen, J. B.; Lloyd, S. P.
Tyyppi	Neural network (encoder-decoder)	Method	Partitional clustering
Alkuperäislähde	Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507.	Thurstone, L. L. (1947). Multiple Factor Analysis. University of Chicago Press.	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.
Rinnakkaisnimet	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
Liittyvät	4	3	4
Tiivistelmä	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.