What would you like to understand?

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 $\mathbb{R}^D$.

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 $\mathbb{R}^D$.

The PCA algorithm subtracts the mean from the data to centralize it, meaning that the mean of all points should be zero. This step prepares the data for the variance-based step that follows, making the formula for the scatter matrix simpler.

Conditions: The data must first be represented as a matrix X.; The subtraction is by the mean $\overline{X}$.; After this step, the video uses $\overline{X} = 0$ in the scatter-matrix discussion.

The PCA algorithm subtracts the mean from the data to centralize it, meaning that the mean of all points should be zero. This step prepares the data for the variance-based step that follows, making the formula for the scatter matrix simpler.

Conditions: The data must first be represented as a matrix X.; The subtraction is by the mean $\overline{X}$.; After this step, the video uses $\overline{X} = 0$ in the scatter-matrix discussion.