Lecture
Kernel K-means: Iterative Clustering Algorithm
Description
This lecture covers the Kernel K-means algorithm, an iterative procedure involving cluster initialization, data point assignment to centroids, and cluster point list updates. The influence of terms in the clustering process, such as the RBF kernel, is discussed. The lecture also delves into interpreting the objective function and the impact of cluster density and point proximity on the algorithm's performance.
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.