Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the K-means algorithm for clustering data into roundish clusters, the properties of K-means, the EM algorithm for the Gaussian mixture model, Jensen's inequality, the Kullback-Leibler divergence, and the Expectation-Maximization algorithm.