Conceptual and empirical comparison of dimensionality reduction algorithms (PCA, KPCA, LDA, MDS, SVD, LLE, ISOMAP, LE, ICA, t-SNE)

DOI10.1016/j.cosrev.2021.100378zbMath1484.68178OpenAlexW3131860561MaRDI QIDQ826335

Bassant Selim, Samira Sadaoui, Farzana Anowar

Publication date: 20 December 2021

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2021.100378

zbMATH Keywords

dimension reductiondata qualityrun-timeclassification accuracycorrelation metricshigh-dimensional datasetsoptimal set of features

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

A two-stage deep learning architecture for model reduction of parametric time-dependent problems

Uses Software

• Scikit

Cites Work

• Kernel PCA for novelty detection
• On the use of \(t\)-distributed stochastic neighbor embedding for data visualization and classification of individuals with Parkinson's disease
• Applications of singular-value decomposition (SVD)
• Principal component analysis: a review and recent developments
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item