EM algorithm for PCA

(35 minutes to learn)


While probabilistic PCA has a closed-form solution, it is infeasible to compute for large and high-dimensional datasets. The expectation-maximization (EM) algorithm provides an alternative. Despite its iterative nature, it can be far more computationally efficient.


This concept has the prerequisites:

Core resources (read/watch one of the following)


See also

-No Additional Notes-