Scribd
Upload
8 views6 pages

Applications of Eiegenvectors in ML

Eigenvalues and Eigenvectors in machine learning(Applications)

Uploaded by

nipun.yadav.ug23
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views6 pages

Applications of Eiegenvectors in ML

Eigenvalues and Eigenvectors in machine learning(Applications)

Uploaded by

nipun.yadav.ug23
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Eigenvectors and

Eigenvalues: Applications
in Machine Learning and
Data Science
by NIPUN YADAV

preencoded.png
Principal Component Analysis (PCA)
Purpose Why Eigenvectors/Eigenvalues?
Dimensionality reduction, data compression, and feature Eigenvectors define the directions of the new axes (principal
extraction. components).
Eigenvalues measure the variance along these directions.
How It Works
Applications:
PCA transforms data into a new coordinate system where the Applications
axes (principal components) are directions of maximum
Reducing dimensionality of large datasets while retaining the
variance. These directions are the eigenvectors of the
most important features (e.g., image compression,
covariance matrix of the data, and the magnitude of variance
bioinformatics). Visualizing high-dimensional data in 2D or 3D
explained by each component is represented by the eigenvalues.
for better interpretability.

preencoded.png
Singular Value Decomposition (SVD)
How It Works
Purpose
SVD decomposes a matrix A into A = U \\Sigma V^T , where
Matrix decomposition for dimensionality reduction, latent
Sigma contains singular values, and U and V are orthogonal
semantics analysis, and low-rank approximations.
matrices of eigenvectors. Eigenvalues correspond to the
squared singular values.
Why Eigenvectors/Eigenvalues?
Applications
They help identify patterns in data matrices, such as latent
Recommender systems (collaborative filtering). Natural
features.
language processing (Latent Semantic Analysis). Image
compression and denoising.

preencoded.png
Spectral Clustering
Purpose How It Works

Partitioning data points into clusters based on graph-based Constructs a similarity graph from the data. Computes the
representations. Laplacian matrix of the graph and finds its eigenvectors and
eigenvalues. Uses the eigenvectors corresponding to the

Why Eigenvectors/Eigenvalues? smallest eigenvalues for clustering.

They encode information about the graph structure and identify Applications
the optimal cluster separations.
Community detection in social networks. Image segmentation.
Grouping customers in market segmentation.

preencoded.png
PageRank Algorithm
Purpose How It Works

Ranks web pages in search engines. Models the web as a graph where nodes represent web pages
and edges represent hyperlinks. Computes the stationary
distribution of a Markov chain using the eigenvector
corresponding to the largest eigenvalue (1).

Why Eigenvectors/Eigenvalues?

The eigenvector reveals the importance (rank) of web pages. Applications

Search engine optimization (SEO). Ranking content in


recommendation systems.

preencoded.png
Covariance Matrix Analysis

Purpose How It Works

Identifying data patterns and relationships between variables. Eigenvectors of the covariance matrix represent the directions
of maximum variance (principal components). Eigenvalues
indicate the magnitude of variance in those directions.
Why Eigenvectors/Eigenvalues?

The eigenvectors help understand variance distribution and Applications


identify correlations .
Community detection in social networks. Image segmentation.
Grouping customers in market segmentation.

preencoded.png

You might also like