Lecture

K-means and Gaussian Mixture Model

Description

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.