Principal Component Analysis

PCA is also called the (discrete) Karhunen-Loève transform (or KLT, named after Kari Karhunen and Michel Loève ) or the '''Hotelling transform''' (in honor of Harold Hotelling ). PCA has the distinction of being the optimal Linear Transformation for keeping the subspace that has largest variance. This advantage, however, comes at the price of greater computational requirement if compared, for example, to the Discrete Cosine Transform . Unlike other linear transforms, the PCA does not have a fixed set of Basis Vector s. Its basis vectors depend on the data set.

Assuming zero Empirical Mean (the empirical mean of the distribution has been subtracted away from the data set), the principal component ''w''₁ of a dataset ''x'' can be defined as:

:

\mathbf{w}_1
 = \arg\max_{\Vert \mathbf{w} \Vert = 1} E\left\{ \left( \mathbf{w}^T \mathbf{x}
ight)^2 
ight\}

(See Arg Max for the notation.) With the first

k - 1

components, the

k

-th component can be found by subtracting the first

k - 1

principal components from ''x'':
:

\mathbf{\hat{x}}_{k - 1}
 = \mathbf{x} -
 \sum_{i = 1}^{k - 1}
 \mathbf{w}_i \mathbf{w}_i^T \mathbf{x}

and by substituting this as the new dataset to find a principal component in
:

\mathbf{w}_k
 = \arg\max_{\Vert \mathbf{w} \Vert = 1} E\left\{
 \left( \mathbf{w}^T \mathbf{\hat{x}}_{k - 1}
 
ight)^2 
ight\}.

The Karhunen-Loève transform is therefore equivalent to finding the Singular Value Decomposition of the data matrix ''X'',

:

\mathbf{X}=\mathbf{W}\mathbf{\Sigma}\mathbf{V}^T,

and then obtaining the reduced-space data matrix Y by projecting '''X''' down into the reduced space defined by only the first ''L'' singular vectors, '''W_L''':

:

\mathbf{Y}=\mathbf{W_L}^T\mathbf{X} = \mathbf{\Sigma_L}\mathbf{V_L}^T

The matrix W of singular vectors of '''X''' is equivalently also the matrix W of eigenvectors of the matrix of observed covariances '''C''' = '''X X^T''',

:

\mathbf{X}\mathbf{X}^T = \mathbf{W}\mathbf{\Sigma}^2\mathbf{W}^T

By finding the Eigenvalue s and Eigenvector s of the covariance matrix, the eigenvectors with the largest eigenvalues correspond to the dimensions that have the strongest Correlation in the dataset (see Rayleigh Quotient ).

PCA is equivalent to Empirical Orthogonal Functions (EOF).

PCA is a popular technique in Pattern Recognition . However, PCA is not optimized for class separability. An alternative is the Linear Discriminant Analysis , which does take this into account. PCA optimally minimizes reconstruction error under the L2 Norm .

TABLE OF SYMBOLS AND ABBREVIATIONS

ALGORITHM #1: THE COVARIANCE METHOD

Following is a detailed description of PCA using the covariance method. The goal is to transform a given data set X of dimension ''M'' to an alternative data set '''Y''' of smaller dimension ''L''. Equivalently, we are seeking to find the matrix '''Y''', where '''Y''' is the Karhunen-Loeve transform (KLT) of matrix X:

:

\mathbf{Y} = \mathbb{KLT} \{ \mathbf{X} \}

Organize the data set

Suppose you have ''N'' data vectors

\mathbf{x}_1 \ldots \mathbf{x}_N

each length ''M'', written as

\mathbf{x}_n = ( \mathbf{x}_n^1 \ldots \mathbf{x}_n^M)

,
and you want to project your data into aמ ''L'' dimensional subspace.

Organize the data into ''N'' column vectors, each of dimensions ''M'' × 1.

Place the column vectors into a single matrix X of dimensions ''M'' × ''N''.

Calculate the empirical mean

Find the empirical mean along each dimension ''m'' = 1...''M''.

Place the calculated mean values into an empirical mean vector vector u of dimensions ''M'' × 1.

u = {1 \over N} \sum_{n=1}^N X[m,n

Calculate the deviations from the mean

Subtract the empirical mean vector u from each column of the data matrix '''X'''.

Store mean-subtracted data in the ''M'' × ''N'' matrix B.

\mathbf{B} = \mathbf{X} - \mathbf{u} \cdot \mathbf{h}

::where h is a 1 x ''N'' row vector of all 1's:

:::

h

{Link without Title} = 1 \, \qquad \qquad \mathrm{for \ } n = 1 \ldots N

Find the covariance matrix

Find the ''M'' × ''M'' empirical covariance matrix C from the Outer Product of matrix '''B''' with itself:

} ight = { 1 \over N-1 } \mathbf{B} \cdot \mathbf{B}^{---}

:::

\mathbb{E}

is the Expected Value operator,
:::

\otimes

is the Outer Product operator, and

\ is the Conjugate Transpose operator.

Find the eigenvectors and eigenvalues of the covariance matrix

Compute the Eigenvalue matrix D and the Eigenvector matrix '''V''' of the covariance matrix '''C''':

\mathbf{C} \cdot \mathbf{V} = \mathbf{V} \cdot \mathbf{D}

::This step will typically require the use of a computer-based algorithm for computing eigenvectors and eigenvalues. These algorithms are readily available as sub-components of most Matrix Algebra systems, such as MatLab . See, for example, the eig function .

Matrix D will take the form of an ''M'' × ''M'' Diagonal Matrix , where

D

{Link without Title}

:is the ''m''th eigenvalue of the covariance matrix C, and

::

D

{Link without Title} = 0 \qquad \mathrm{for} \qquad p e q.

Matrix V, also of dimension ''M'' × ''M'', contains ''M'' column vectors, each of length ''M'', which represent the ''M'' eigenvectors of the covariance matrix '''C'''.

The eigenvalules and eigenvectors are ordered and paired. The ''m''th eigenvalue corresponds to the ''m''th eigenvector.

Rearrange the eigenvectors and eigenvalues

Sort the columns of the eigenvector matrix V and eigenvalue matrix '''D''' in order of ''decreasing'' eigenvalue.

Make sure to maintain the correct pairings between the columns in each matrix.

Compute the cumulative energy content for each eigenvector

The eigenvalues represent the distribution of the source data's energy among each of the eigenvectors, where the eigenvectors form a Basis for the data. The cumulative energy content ''g'' for the ''m''th eigenvector is the sum of the energy content across all of the eigenvectors from 1 through ''m'':

\qquad \mathrm{for} \qquad p = q \qquad \mathrm{and} \qquad m = 1...M

Select a subset of the eigenvectors as basis vectors

Save the first ''L'' columns of V as the ''M'' × ''L'' matrix '''W''':

\qquad \mathrm{for} \qquad p = 1...M \qquad q = 1...L

:where

::

1 \leq L \leq M.

Use the vector g as a guide in choosing an appropriate value for ''L''. The goal is to choose as small a value of ''L'' as possible while achieving a reasonably high value of ''g'' on a percentage basis. For example, you may want to choose ''L'' so that the cumulative energy ''g'' is above a certain threshold, like 90 percent. In this case, choose the smallest value of ''L'' such that

g

{Link without Title} \ge 90%

Convert the source data to z-scores

Create an ''M'' × 1 empirical standard deviation vector s from the square root of each element along the main diagonal of the covariance matrix '''C''':

} \qquad \mathrm{for \ } p = q = m = 1 \ldots M

Calculate the ''M'' × ''N'' Z-score matrix:

\mathbf{Z} = { \mathbf{B} \over \mathbf{s} \cdot \mathbf{h} }

Project the z-scores of the data onto the new basis

The projected vectors are the columns of the matrix

\cdot \mathbf{Z} = \mathbb{KLT} \{ \mathbf{X} \}.

The columns of matrix Y represent the Karhunen-Loeve transforms (KLT) of the data vectors in the columns of matrix '''X'''.

ALGORITHM #2: THE CORRELATION METHOD

Editor's note: This section is currently undergoing a major revision. See page history for previous revisions.

''DERIVATION'' OF PCA USING THE COVARIANCE METHOD

Let X be a ''d''-dimensional random vector expressed as column vector.
Without loss of generality, assume X has zero empirical mean.
We want to find a

d 	imes d

Orthonormal Projection Matrix P such that

:

\mathbf{Y} = \mathbf{P}^	op \mathbf{X}

with the constraint that

:

\operatorname{cov}(\mathbf{Y})

is a Diagonal Matrix and

\mathbf{P}^{-1} = \mathbf{P}^	op.

By substitution, and matrix algebra, we obtain:

:

\mathbf{P} \ \ &=& \mathbf{P}^ op \operatorname{cov}(\mathbf{X}) \mathbf{P} \end{matrix}

We now have:

:

\begin{matrix}
\mathbf{P}\operatorname{cov}(\mathbf{Y}) &=& \mathbf{P} \mathbf{P}^	op \operatorname{cov}(\mathbf{X}) \mathbf{P}\
\ &=& \operatorname{cov}(\mathbf{X}) \mathbf{P}\
\end{matrix}

Rewrite P as d

d 	imes 1

column vectors, so

:

\mathbf{P} = P_2, \ldots, P_d

and

\operatorname{cov}(\mathbf{Y})

as:

:

\begin{bmatrix}
\lambda_1 & \cdots & 0 \
dots & \ddots & dots \
0 & \cdots & \lambda_d
\end{bmatrix}.

Substituting into equation above, we obtain:

:

= [\operatorname{cov}(X)P_1, \operatorname{cov}(X)P_2, \ldots, \operatorname{cov}(X)P_d].

Notice that in

\lambda_i P_i = \operatorname{cov}(X)P_i

, ''P''_i is an Eigenvector of ''X′''s covariance matrix. Therefore, by finding the eigenvectors of ''X′''s covariance matrix, we find a projection matrix ''P'' that satisfies the original constraints.

CORRESPONDENCE ANALYSIS

Correspondence analysis is conceptually similar to PCA, but scales the data (which must be positive) so that rows and columns are treated equivalently. It is traditionally applied to contingency tables where Pearson's Chi-square Test has shown a relationship between rows and columns.

SOFTWARE/SOURCE CODE

Computer Vision Libray

Multivariate Data Analysis Software

REFERENCES

	Author	Pearson, K
	Year	1901
	Title	On Lines and Planes of Closest Fit to Systems of Points in Space
	Journal	Philosophical Magazine
	Volume	2 issue = 6 pages = 559–572
	Url	http://pbiluniv-lyon1fr/R/liens/pearson1901pdf

	CATEGORIES ABOUT PRINCIPAL COMPONENTS ANALYSIS

	multivariate statistics

	singular value decomposition

	data mining

	mathematical components

	APPAREL
	BABY
	BEAUTY
	BOOKS
	CAR TOYS
	CELL PHONES
	DVD'S
	ELECTRONICS
	GOURMET FOOD
	GROCERIES
	HEALTH & PERSONAL
	HOME & GARDEN
	JEWELRY
	MUSIC
	MUSIC INSTRUMENTS
	OFFICE PRODUCTS
	SOFTWARE
	SPORTING GOODS
	TOOLS & HARDWARE
	TOYS
	VIDEO GAMES
	SHOPPING HOME

	MORE SHOPPING...

Information About

Principal Component Analysis