Lecture
K-means Algorithm
Description
This lecture covers the K-means algorithm for clustering data samples into k classes without labels, aiming to minimize the loss function. The instructor explains the process step by step, from initializing k centers at random to updating the centers iteratively. The lecture also touches on the expectation maximization-like approach and the challenges of computationally hard problems in clustering.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on MediaspaceOfficial source
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.