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 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 Mediaspace