Dimensionality reduction is a technique that simplifies high-dimensional data while preserving essential patterns for analysis or visualization.The process of transforming data from a high-dimensional feature space to a low-dimensional one with minimal loss of significant information. Used both for visualization (projecting onto 2D or 3D) and as preprocessing before machine learning to reduce computational complexity and avoid the 'curse of dimensionality' (degradation of algorithm performance as the number of features grows).
Principal component analysis (PCA) was proposed by Karl Pearson in 1901; later independently developed by Harold Hotelling in the 1930s. In the 1960s–70s, multidimensional scaling methods appeared. The t-distributed stochastic neighbor embedding (t-SNE) algorithm was introduced by Laurens van der Maaten and Geoffrey Hinton in 2008, revolutionizing visualization. UMAP (2018) improved global structure preservation and speed.
Linear PCA method: compute the covariance matrix of the data; its eigenvectors corresponding to the largest eigenvalues form a new orthonormal basis; projecting onto the first m eigenvectors gives the reduced representation. Nonlinear autoencoder: a neural network with a bottleneck is trained to reconstruct the input; the hidden representation in the bottleneck serves as a low-dimensional code. t-SNE models the probabilities that a point is a neighbor of another in the original and target spaces, minimizing the Kullback–Leibler divergence between them.
Accelerating image search, compressing medical images, visualizing complex relationships, for example, in genetics.
Principal component analysis (PCA) is often used to compress facial images: a 10,000-pixel snapshot can be transmitted with just a hundred numbers, and the face remains recognizable.

















