293 views
1 1 vote

Principal Component Analysis (PCA) is applied to reduce the dimensionality of data from $\mathbf{1 0 0}$ dimensions to $\mathbf{1 0}$ dimensions.

Let the angle between the first principal component and the $\mathbf{10th}$ principal component be $\theta$.

Which of the following is correct?

  1. $0<\theta<90^{\circ}$
     
  2. $\theta=0^{\circ}$
     
  3. $90^{\circ}<\theta<180^{\circ}$
     
  4. $\theta=90^{\circ}$

1 Answer

0 0 votes

Answer: D  \( \theta = 90^\circ \)

We can think as Linear Algebra Perspective or as Variance Maximization Perspective.


Properties of a Symmetric Matrix:

  • All eigenvectors of a symmetric matrix are linearly independent.
  • Eigenvectors corresponding to distinct eigenvalues are orthogonal. If \( \lambda_i \ne \lambda_j \), then \( v_j^\top v_i = 0 \).

Principal components are eigenvectors of the data covariance matrix \( S = \frac{1}{n} X^\top X \).

Since the covariance matrix is symmetric, all principal component vectors can be chosen to be orthogonal to each other. Therefore, \( \theta = 90^\circ \).


Each principal component captures the maximum remaining variance.

Since we do not want any redundancy while capturing variance, we require the covariance between any two principal components to be zero, i.e., \( \text{Cov}(z_i, z_j) = 0 \quad (i \ne j) \).

Uncorrelated linear projections in Euclidean space imply orthogonal directions. \( \Rightarrow \theta = 90^\circ \)

Answer:
Position:
Show:

Related questions

0 0 votes
1 1 answer
356
356 views
GO Classes asked Feb 17
356 views
Consider a linear model $$y_{\text{pred}} = w^T x$$with Mean Absolute Error (MAE) loss and $L_2$ regularization..Given:\[\lambda = 0.20, \quad w = \begin{bmatrix} -3 \\ 4...
1 1 vote
1 1 answer
328
328 views
GO Classes asked Feb 16
328 views
There are $20$ books of author $X$ and $10$ books of author $Y$, all placed together at one place without labels. $6$ books of author $X$ are classified as author $Y$. $2...
2 2 votes
2 2 answers
376
376 views
GO Classes asked Feb 16
376 views
Let $M=I_n-\frac{1}{n}\mathbf{1}\mathbf{1}^T$, where $\mathbf{1}=(1,1,\dots,1)^T\in\mathbb{R}^n$.Consider the optimization problem $\max_{x} (x^T A x)$ subject to $x^T x=...
1 1 vote
0 0 answers
261
261 views
GO Classes asked Feb 16
261 views
Consider a linear model $f(x)=wx$. Using stochastic gradient descent with learning rate $\lambda=0.10$, if at iteration $i$, $w_i=10.00$, then $w_{i+1}= \_\_\_\_\_$