In the PCA setup shown here, the data matrix X is organized such that its rows are data points and its columns are features. Each row is treated as a D-dimensional vector.
Conditions: Rows correspond to data points.; Columns correspond to features.; Each row lies in RD.
In the PCA setup shown here, the data matrix X is organized such that its rows are data points and its columns are features. Each row is treated as a D-dimensional vector.
Conditions: Rows correspond to data points.; Columns correspond to features.; Each row lies in RD.
The notation D=2 -> D' = 1 means reducing a two-dimensional dataset to one dimension. It frames PCA as a method for compressing a two-dimensional description of data into a one-dimensional summary while keeping the most important directions of variation.
Conditions: The displayed example uses a two-dimensional dataset.; The target reduced dimension shown is one.
The notation D=2 -> D' = 1 means reducing a two-dimensional dataset to one dimension. It frames PCA as a method for compressing a two-dimensional description of data into a one-dimensional summary while keeping the most important directions of variation.
Conditions: The displayed example uses a two-dimensional dataset.; The target reduced dimension shown is one.
The video uses an ellipse to explain principal components because it provides an intuitive geometric model for the data cloud. The main axes of the ellipse are identified as the directions PCA wants to find, which are called principal components.
Conditions: The data are approximated by an ellipse.; The ellipse is described verbally as 'basically a two-dimensional Gaussian.'
The video uses an ellipse to explain principal components because it provides an intuitive geometric model for the data cloud. The main axes of the ellipse are identified as the directions PCA wants to find, which are called principal components.
Conditions: The data are approximated by an ellipse.; The ellipse is described verbally as 'basically a two-dimensional Gaussian.'