ABSTRACT

Unsupervised Learning Approaches for Dimensionality Reduction and Data Visualization describes such algorithms as Locally Linear Embedding (LLE), Laplacian Eigenmaps, Isomap, Semidefinite Embedding, and t-SNE to resolve the problem of dimensionality reduction in the case of non-linear relationships within the data. Underlying mathematical concepts, derivations, and proofs with logical explanations for these algorithms are discussed, including strengths and limitations. The book highlights important use cases of these algorithms and provides examples along with visualizations. Comparative study of the algorithms is presented to give a clear idea on selecting the best suitable algorithm for a given dataset for efficient dimensionality reduction and data visualization.

FEATURES

  • Demonstrates how unsupervised learning approaches can be used for dimensionality reduction
  • Neatly explains algorithms with a focus on the fundamentals and underlying mathematical concepts
  • Describes the comparative study of the algorithms and discusses when and where each algorithm is best suitable for use
  • Provides use cases, illustrative examples, and visualizations of each algorithm
  • Helps visualize and create compact representations of high dimensional and intricate data for various real-world applications and data analysis

This book is aimed at professionals, graduate students, and researchers in Computer Science and Engineering, Data Science, Machine Learning, Computer Vision, Data Mining, Deep Learning, Sensor Data Filtering, Feature Extraction for Control Systems, and Medical Instruments Input Extraction.

chapter 1|4 pages

Introduction to Dimensionality Reduction

chapter 2|12 pages

Principal Component Analysis (PCA)

chapter 3|4 pages

Dual PCA

chapter 4|14 pages

Kernel PCA

chapter 5|6 pages

Canonical Correlation Analysis (CCA)

chapter 6|11 pages

Multidimensional Scaling (MDS)

chapter 7|13 pages

Isomap

chapter 8|16 pages

Random Projections

chapter 9|15 pages

Locally Linear Embedding

chapter 10|9 pages

Spectral Clustering

chapter 11|12 pages

Laplacian Eigenmap

chapter 12|5 pages

Maximum Variance Unfolding