Lecture

Kernel K-Means Method

Description

This lecture covers the kernel k-means method, which aims to avoid suboptimal solutions by initializing centroids to maximize their dispersion among the data. It introduces the concept of kernels to describe data in non-Euclidean spaces, allowing the formation of non-convex clusters. The lecture explains the derivation of the kernel k-means algorithm, highlighting the calculation of distances between observations and centroids. It also discusses the application of support vector machines (SVM) in non-linear problems through data redescription in Hilbert spaces. Additionally, the lecture explores clustering by density, emphasizing the identification of dense regions in datasets without predefined labels.

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

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.