Home / machine learning Andrew NG / Coursera: Machine Learning-Andrew NG(Week 8) Quiz - Principal Component Analysis

Coursera: Machine Learning-Andrew NG(Week 8) Quiz - Principal Component Analysis

Coursera: Machine Learning-Andrew NG(Week 8) Quiz - Principal Component Analysis


 These solutions are for reference only.

It is recommended that you should solve the assignment and quiz by yourself honestly then only it makes sense to complete the course.
but if you cant figure out some part of it than you can refer these solutions

make sure you understand the solution
dont just copy paste it

answers in green colour

----------------------------------------------------------------------------------------------

▸ Principal Component Analysis :











  1. Consider the following 2D dataset:
    enter image description here
    Which of the following figures correspond to possible values that PCA may return for  (the first eigen vector / first principal component)? Check all that apply (you may have to check more than one figure).

    •  Figure 1:
      enter image description here
       The maximal variance is along the y = x line, so this option is correct.

    •  Figure 2:
      enter image description here
       The maximal variance is along the y = x line, so the negative vector along that line is correct for the first principal component.

    •  Figure 3:
      enter image description here

    •  Figure 4:
      enter image description here

  1. Which of the following is a reasonable way to select the number of principal components k?
    (Recall that n is the dimensionality of the input data and m is the number of input examples.)
    •  Choose k to be the smallest value so that at least 99% of the variance is retained.
       This is correct, as it maintains the structure of the data while maximally reducing its dimension.

    •  Choose k to be the smallest value so that at least 1% of the variance is retained.

    •  Choose k to be 99% of n (i.e., k = 0.99 ∗ n, rounded to the nearest integer).

    •  Choose the value of that minimizes the approximation error 

    •  Choose k to be the largest value so that at least 99% of the variance is retained

    •  Use the elbow method.

    •  Choose k to be 99% of m (i.e., k = 0.99 ∗ m, rounded to the nearest integer).

  1. Suppose someone tells you that they ran PCA in such a way that “95% of the variance was retained.” What is an equivalent statement to this?

    •  

    •  

    •  
       This is the correct formula.

    •  

    •  

    •  

    •  

    •  



  1. Which of the following statements are true? Check all that apply.

    •  Given only  and , there is no way to reconstruct any reasonable approximation to .

      •
    •  Even if all the input features are on very similar scales, we should still perform mean normalization (so that each feature has zero mean) before running PCA.
       If you do not perform mean normalization, PCA will rotate the data in a possibly undesired way.

    •  Given input data , it makes sense to run PCA only with values of k that satisfy . (In particular, running it with  is possible but not helpful, and  does not make sense.)
       The reasoning given is correct: with , there is no compression, so PCA has no use.

    •  PCA is susceptible to local optima; trying multiple random initializations may help.

    •  PCA can be used only to reduce the dimensionality of data by 1 (such as 3D to 2D, or 2D to 1D).

    •  Given an input , PCA compresses it to a lower-dimensional vector .
       PCA compresses it to a lower dimensional vector by projecting it onto the learned principal components.

    •  If the input features are on very different scales, it is a good idea to perform feature scaling before applying PCA.
       Feature scaling prevents one feature dimension from becoming a strongvprincipal component only because of the large magnitude of the featurevvalues (as opposed to large variance on that dimension).

    •  Feature scaling is not useful for PCA, since the eigenvector calculation (such as using Octave’s svd(Sigma) routine) takes care of this automatically.


  1. Which of the following are recommended applications of PCA? Select all that apply.

    •  To get more features to feed into a learning algorithm.

    •  Data compression: Reduce the dimension of your data, so that it takes up less memory / disk space.
       If memory or disk space is limited, PCA allows you to save space in exchange for losing a little of the data’s information. This can be a reasonable tradeoff.

    •  Preventing overfitting: Reduce the number of features (in a supervised learning problem), so that there are fewer parameters to learn.

    •  Data visualization: Reduce data to 2D (or 3D) so that it can be plotted.
       This is a good use of PCA, as it can give you intuition about your data that would otherwise be impossible to see.

      •
    •  Data compression: Reduce the dimension of your input data , which will be used in supervised learning algorithm (i.e., use PCA so that your supervised learning algorithm runs faster ).
       If your learning algorithm is too slow because of the input dimension is too high, then using PCA to speed it up is a reasonable choice.

    •  As a replacement for (or alternative to) linear regression: For most learning applications, PCA and linear regression give sustantially similar results.

    •  Data visualization: To take 2D data, and find a different way of plotting it in 2D (using k=2)



 
darkmode