Principal components analysis

From Wikipedia, the free encyclopedia

It has been suggested that this article or section be merged with Proper orthogonal decomposition. (Discuss)

In statistics, principal components analysis (PCA) is a technique for simplifying a data set, by reducing multidimensional data sets to lower dimensions for analysis.

Technically speaking, PCA is an orthogonal linear transformation that transforms the data to a new coordinate system such that the greatest variance by any projection of the data comes to lie on the first coordinate (called the first principal component), the second greatest variance on the second coordinate, and so on. PCA can be used for dimensionality reduction in a data set while retaining those characteristics of the data set that contribute most to its variance, by keeping lower-order principal components and ignoring higher-order ones. Such low-order components often contain the "most important" aspects of the data. But this is not necessarily the case, depending on the application.

For a data matrix with zero empirical mean X^T, (the empirical mean of the distribution has been subtracted from the data set), where each row represents a different repetition of the experiment, and each column gives the results from a particular probe, the PCA transformation is given by:

$\mathbf{Y^T}=\mathbf{X^T}\mathbf{W}$

$= \mathbf{V}\mathbf{\Sigma}$

where V Σ W^T is the singular value decomposition (svd) of X^T.

In this article we shall adopt the other convention, so that each column is made up of results for a different subject, and each row the results from a different probe. This will mean that the PCA for our data matrix X will be given by:

$\mathbf{Y}=\mathbf{W}^T\mathbf{X}$

$= \mathbf{\Sigma}\mathbf{V^T}$

where W Σ V^T is the svd of X.

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, PCA does not have a fixed set of basis vectors. Its basis vectors depend on the data set.

[edit] Discussion

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

$\mathbf{w}_1 = \arg\max_{\Vert \mathbf{w} \Vert = 1} \operatorname{var}\{ \mathbf{w}^T \mathbf{x} \} = \arg\max_{\Vert \mathbf{w} \Vert = 1} E\left\{ \left( \mathbf{w}^T \mathbf{x}\right)^2 \right\}$

(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 data set 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} \right)^2 \right\}.$

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 the matrix W of eigenvectors of the matrix of observed covariances C = X X^T,

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

The eigenvectors with the largest eigenvalues correspond to the dimensions that have the strongest correlation in the data set (see Rayleigh quotient).

PCA is equivalent to empirical orthogonal functions (EOF).

An autoencoder neural network with a linear hidden layer is also equivalent to PCA. Upon convergence, the weight vectors of the K neurons in the hidden layer will form a basis for the space spanned by the first K principal components. Unlike PCA, this technique will not necessarily produce orthogonal vectors.

PCA is a popular technique in pattern recognition. But it is not optimized for class separability^[1]. An alternative is the linear discriminant analysis, which does take this into account. PCA optimally minimizes reconstruction error under the L2 norm.

[edit] Relation to K-means clustering

It has been shown recently ^[2] ^[3] that the relaxed solution of K-means clustering, specified by the cluster indicators, are given by the PCA (principal component analysis) principal components, and the PCA subspace spanned by the principal directions is identical to the cluster centroid subspace specified by the between-class scatter matrix.

[edit] Table of symbols and abbreviations

Symbol	Meaning	Dimensions	Indices
$\mathbf{X} = \{ X[m,n] \}$	data matrix, consisting of the set of all data vectors, one vector per column	$M \times N$	$m = 1 \ldots M$ $n = 1 \ldots N$
$N \,$	the number of column vectors in the data set (dimension)	$1 \times 1$	scalar
$M \,$	the number of elements in each column vector	$1 \times 1$	scalar
$L \,$	the number of dimensions in the dimensionally reduced subspace, $1 \le L \le M$	$1 \times 1$	scalar
$\mathbf{u} = \{ u[m] \}$	vector of empirical means, one mean for each row m of the data matrix	$M \times 1$	$m = 1 \ldots M$
$\mathbf{s} = \{ s[m] \}$	vector of empirical standard deviations, one standard deviation for each row m of the data matrix	$M \times 1$	$m = 1 \ldots M$
$\mathbf{h} = \{ h[n] \}$	vector of all 1's	$1 \times N$	$n = 1 \ldots N$
$\mathbf{B} = \{ B[m,n] \}$	deviations from the mean of each row m of the data matrix	$M \times N$	$m = 1 \ldots M$ $n = 1 \ldots N$
$\mathbf{Z} = \{ Z[m,n] \}$	z-scores, computed using the mean and standard deviation for each row m of the data matrix	$M \times N$	$m = 1 \ldots M$ $n = 1 \ldots N$
$\mathbf{C} = \{ C[p,q] \}$	covariance matrix	$M \times M$	$p = 1 \ldots M$ $q = 1 \ldots M$
$\mathbf{R} = \{ R[p,q] \}$	correlation matrix	$M \times M$	$p = 1 \ldots M$ $q = 1 \ldots M$
$\mathbf{V} = \{ V[p,q] \}$	matrix consisting of the set of all eigenvectors of C, one eigenvector per column	$M \times M$	$p = 1 \ldots M$ $q = 1 \ldots M$
$\mathbf{D} = \{ D[p,q] \}$	diagonal matrix consisting of the set of all eigenvalues of C along its principal diagonal, and 0 for all other elements	$M \times M$	$p = 1 \ldots M$ $q = 1 \ldots M$
$\mathbf{W} = \{ W[p,q] \}$	matrix of basis vectors, one vector per column, where each basis vector is one of the eigenvectors of C, and where the vectors in W are a sub-set of those in V	$M \times L$	$p = 1 \ldots M$ $q = 1 \ldots L$
$\mathbf{Y} = \{ Y[m,n] \}$	matrix consisting of N column vectors, where each vector is the projection of the corresponding data vector from matrix X onto the basis vectors contained in the columns of matrix W.	$L \times N$	$m = 1 \ldots L$ $n = 1 \ldots N$

[edit] 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} \}$

[edit] Organize the data set

Suppose you have data comprising a set of observations of M variables, and you want to reduce the data so that each observation can be described with only L variables, L < M. Suppose further, that the data are arranged as a set of N data vectors $\mathbf{x}_1 \ldots \mathbf{x}_N$ with each $\mathbf{x}_n$ representing a single grouped observation of the M variables.

Write $\mathbf{x}_1 \ldots \mathbf{x}_N$ as column vectors, each of which has M rows.
Place the column vectors into a single matrix X of dimensions M × N.

[edit] Calculate the empirical mean

Find the empirical mean along each dimension m = 1...M.
Place the calculated mean values into an empirical mean vector u of dimensions M × 1.

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

[edit] 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[n] = 1 \, \qquad \qquad \mathrm{for \ } n = 1 \ldots N$

[edit] Find the covariance matrix

Find the M × M empirical covariance matrix C from the outer product of matrix B with itself:

$\mathbf{C} = \mathbb{ E } \left[ \mathbf{B} \otimes \mathbf{B} \right] = \mathbb{ E } \left[ \mathbf{B} \cdot \mathbf{B}^{*} \right] = { 1 \over N } \mathbf{B} \cdot \mathbf{B}^{*}$

where

$\mathbb{E}$ is the expected value operator,

$\otimes$ is the outer product operator, and

$* \$ is the conjugate transpose operator.

[edit] Find the eigenvectors and eigenvalues of the covariance matrix

Compute the matrix V of eigenvectors which diagonalizes the covariance matrix C:

$\mathbf{V}^{-1} \mathbf{C} \mathbf{V} = \mathbf{D}$

where D is the diagonal matrix of eigenvalues of C. This step will typically involve 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, Mathematica or SciPy. See, for example, the eig function.

Matrix D will take the form of an M × M diagonal matrix, where

$D[p,q] = \lambda_m \qquad \mathrm{for} \qquad p = q = m$

is the mth eigenvalue of the covariance matrix C, and

$D[p,q] = 0 \qquad \mathrm{for} \qquad p \ne 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 eigenvalues and eigenvectors are ordered and paired. The mth eigenvalue corresponds to the mth eigenvector.

[edit] 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.

[edit] 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 mth eigenvector is the sum of the energy content across all of the eigenvectors from 1 through m:

$g[m] = \sum_{q=1}^m D[p,q] \qquad \mathrm{for} \qquad p = q \qquad \mathrm{and} \qquad m = 1...M$

[edit] Select a subset of the eigenvectors as basis vectors

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

$W[p,q] = V[p,q] \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[m=L] \ge 90%$

[edit] 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:

$\mathbf{s} = \{ s[m] \} = \sqrt{C[p,q]} \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} }$ (divide element-by-element)

Note: While this step is useful for various applications as it normalizes the data set with respect to its variance, it is not integral part of PCA/KLT!

[edit] Project the z-scores of the data onto the new basis

The projected vectors are the columns of the matrix

$\mathbf{Y} = \mathbf{W}^* \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.

[edit] Algorithm #2: the correlation method

This section is a stub. You can help by expanding it.

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

[edit] 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 \times d$ orthonormal transformation matrix P such that

$\mathbf{Y} = \mathbf{P}^\top \mathbf{X}$

with the constraint that

$\operatorname{cov}(\mathbf{Y})$ is a diagonal matrix and $\mathbf{P}^{-1} = \mathbf{P}^\top.$

By substitution, and matrix algebra, we obtain:

$\begin{matrix} \operatorname{cov}(\mathbf{Y}) &=& \mathbb{E}[ \mathbf{Y} \mathbf{Y}^\top]\\ \ &=& \mathbb{E}[( \mathbf{P}^\top \mathbf{X} ) ( \mathbf{P}^\top \mathbf{X} )^\top]\\ \ &=& \mathbb{E}[(\mathbf{P}^\top \mathbf{X}) (\mathbf{X}^\top \mathbf{P})] \\ \ &=& \mathbf{P}^\top \mathbb{E}[\mathbf{X} \mathbf{X}^\top] \mathbf{P} \\ \ &=& \mathbf{P}^\top \operatorname{cov}(\mathbf{X}) \mathbf{P} \end{matrix}$

We now have:

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

Rewrite P as d $d \times 1$ column vectors, so

$\mathbf{P} = [P_1, P_2, \ldots, P_d]$

and $\operatorname{cov}(\mathbf{Y})$ as:

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

Substituting into equation above, we obtain:

$[\lambda_1 P_1, \lambda_2 P_2, \ldots, \lambda_d P_d] = [\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.

[edit] 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.

[edit] Software/source code

[edit] References

Fukunaga, Keinosuke. "[2] ((1990). Introduction to Statistical Pattern Recognition. Elsevier.".
Pearson, K. (1901). "On Lines and Planes of Closest Fit to Systems of Points in Space". Philosophical Magazine 2 (6): 559–572.

^ "Introduction to Statistical Pattern Recognition." [1]
^ H. Zha, C. Ding, M. Gu, X. He and H.D. Simon. "Spectral Relaxation for K-means Clustering", Neural Information Processing Systems vol.14 (NIPS 2001). pp. 1057-1064, Vancouver, Canada. Dec. 2001.
^ Chris Ding and Xiaofeng He. "K-means Clustering via Principal Component Analysis". Proc. of Int'l Conf. Machine Learning (ICML 2004), pp 225-232. July 2004.

[edit] See also

[edit] External links

'만들기 / Programming > research' 카테고리의 다른 글

BRDF (0)	2007.06.28
Eigenvalue, eigenvector and eigenspace (0)	2007.04.20
K-nearest neighbor algorithm (1)	2007.04.10
Support vector machine (0)	2007.04.05
Image:Mandel zoom 00 mandelbrot set.jpg (0)	2007.04.04

sune is

Principal components analysis

Principal components analysis

From Wikipedia, the free encyclopedia

Contents

[edit] Discussion

[edit] Relation to K-means clustering

[edit] Table of symbols and abbreviations

[edit] Algorithm #1: the covariance method

[edit] Organize the data set

[edit] Calculate the empirical mean

[edit] Calculate the deviations from the mean

[edit] Find the covariance matrix

[edit] Find the eigenvectors and eigenvalues of the covariance matrix

[edit] Rearrange the eigenvectors and eigenvalues

[edit] Compute the cumulative energy content for each eigenvector

[edit] Select a subset of the eigenvectors as basis vectors

[edit] Convert the source data to z-scores

[edit] Project the z-scores of the data onto the new basis

[edit] Algorithm #2: the correlation method

[edit] Derivation of PCA using the covariance method

[edit] Correspondence analysis

[edit] Software/source code

[edit] References

[edit] See also

[edit] External links

'만들기 / Programming > research' 카테고리의 다른 글

티스토리툴바

Principal components analysis

Principal components analysis

From Wikipedia, the free encyclopedia

Contents

[edit] Discussion

[edit] Relation to K-means clustering

[edit] Table of symbols and abbreviations

[edit] Algorithm #1: the covariance method

[edit] Organize the data set

[edit] Calculate the empirical mean

[edit] Calculate the deviations from the mean

[edit] Find the covariance matrix

[edit] Find the eigenvectors and eigenvalues of the covariance matrix

[edit] Rearrange the eigenvectors and eigenvalues

[edit] Compute the cumulative energy content for each eigenvector

[edit] Select a subset of the eigenvectors as basis vectors

[edit] Convert the source data to z-scores

[edit] Project the z-scores of the data onto the new basis

[edit] Algorithm #2: the correlation method

[edit] Derivation of PCA using the covariance method

[edit] Correspondence analysis

[edit] Software/source code

[edit] References

[edit] See also

[edit] External links

'만들기 / Programming > research' 카테고리의 다른 글

'만들기 / Programming/research' Related Articles

티스토리툴바