CS229 Lecture notes Andrew Ng Mixtures of Gaussians and the EM algorithm In this set of notes, we discuss the EM (Expectation-Maximization) for density estimation. Suppose that we are given a training set {x(1) , . . . ,

First Page		Document Content
Date: 2012-11-26 03:26:12		CS229 Lecture notes Andrew Ng Mixtures of Gaussians and the EM algorithm In this set of notes, we discuss the EM (Expectation-Maximization) for density estimation. Suppose that we are given a training set {x(1) , . . . , Add to Reading List Source URL: cs229.stanford.edu Download Document from Source Website File Size: 50,55 KB Share Document on Facebook