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 k-means algorithm, introducing the k-means++ algorithm to improve initialization and avoid suboptimal solutions. It explains the kernel trick for non-convex clusters and the application of k-means with kernels. Additionally, it delves into clustering by density, highlighting the DBSCAN algorithm and the evaluation criteria for clustering methods.