Select all true statements regarding standard PCA applied on a centered dataset.
The variance of the dataset along the first principal component is maximum.
The variance of the dataset along the first principal component is minimum.
The first principal component is the unit norm eigenvector corresponding tothe largest eigenvalue of the covariance matrix.
The first principal component is the unit norm eigenvector corresponding tothe smallest eigenvalue of the covariance matrix.
Q4MSQ4 marksselect all that apply
The covariance matrix corresponding to this dataset has 30 non-zeroeigenvalues.
The covariance matrix corresponding to this dataset has only four non-zeroeigenvalues.
The residues will become zero after four rounds
By utilizing four principal component vectors and their correspondingcoefficients, we have the ability to reconstruct the complete dataset using representatives.
Q5MSQ5 marksselect all that apply
Which of the following statements about kernel PCA is/are always true?
Q6MSQ5 marksselect all that apply
Q7MSQ3.5 marksselect all that apply
Which of the following statements is/are true?
Q8SA4 marks
Q9SA4 marks
Q10SA4 marks
Q11SA4.5 marks
Comprehension passage - the questions below it refer to this
Based on the above data, answer the given subquestions.
Q12SA2 marks
What is the value of a? Enter your answer correct to three decimal places.
Q13SA2 marks
What is the value of b? Enter your answer correct to two decimal places.
Auto-generated summary from the source site. Handy as a checklist; the lessons above explain each idea from scratch.
Summary of Core Topics, Concepts, Principles, and Equations
1. Kernel Functions and Transformation Mappings
Kernel Functions: Functions that compute the dot product of the transformed input data in a higher-dimensional space.
Transformation Mapping (ϕ): Maps input data to a higher-dimensional space.
Example: For a given kernel k([x1,x2]T,[y1,y2]T)=1+x1y1+x2y2+x12y12x2y2+x1y1x22y22, the appropriate transformation mapping is:
ϕ([x1,x2]T)=[1,x1,x2,x12x2,x1x22]
2. Principal Component Analysis (PCA)
Standard PCA: Applied on a centered dataset to find the directions (principal components) of maximum variance.
Variance: The variance of the dataset along the first principal component is maximum.
Eigenvalues and Eigenvectors: The first principal component is the unit norm eigenvector corresponding to the largest eigenvalue of the covariance matrix.
Low-Dimensional Subspace: If all points lie in a four-dimensional low subspace, the covariance matrix has only four non-zero eigenvalues.
3. Kernel PCA
Kernel PCA: Extension of PCA using kernel functions to handle non-linear data.
Valid Kernel Functions: For every transformation mapping ϕ:Rd→RD, there exists a valid kernel function.
Combination of Kernels: For two valid kernels k1,k2:Rd×Rd→R, ak1+bk2 is a valid kernel function where a and b are positive real numbers.
4. Lloyd's Algorithm (K-Means Clustering)
Lloyd's Algorithm: Iterative algorithm to partition data into k clusters.
Initialization: Initial cluster centers are chosen, and the algorithm iteratively updates the centers to minimize within-cluster variance.
Example: For a dataset {−3,−1,0,1,4,299,300,301} with initial centers −10 and 310, the final cluster centers a and b can be found, and their product ab can be computed.
5. Gaussian Mixture Models (GMM)
GMM: Probabilistic model that assumes all the data points are generated from a mixture of a finite number of Gaussian distributions.
Probability Calculation: The probability that a point x comes from a specific component can be calculated using the Gaussian density function.
Example: For a GMM with two components, the probability that the point x=1.2 comes from the first component can be calculated using the given table of Gaussian densities.
6. Beta Distribution and Bernoulli Distribution
Beta Distribution: Used as a prior and posterior distribution for the parameter p in a Bernoulli distribution.
Example: For a dataset with 60 points, if the prior and posterior distributions for p are Beta(10,5) and Beta(30,45) respectively, the number of data points with the value 0 can be determined.