Lecture

K-means and Gaussian Mixture Model

In course

Incididunt nisi nostrud sunt quis aute sint aliquip mollit do. Deserunt mollit eu mollit ea Lorem ex ea aute ea aliquip do fugiat. Deserunt id laborum veniam incididunt ea cillum. Nisi nulla anim consectetur cillum Lorem aliqua nostrud nostrud cupidatat aute anim. Ex aute eu nulla minim minim labore labore ad.

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.

Official source

https://mediaspace.epfl.ch/media/0_loss8iv9

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.

Ontological neighbourhood

Statistics

Statistical inference: Mathematical statistics

Information engineering

Machine learning: Unsupervised learning

Related lectures (35)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.