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 advanced structure discovery techniques, including clustering algorithms like K-Means, Spectral, and Hierarchical Agglomerative Clustering. It delves into distance/similarity measures for time series data, such as Euclidean, Jaccard, Hamming, and Earth Mover distances. The lecture also explores similarity measures like Cosine and Gaussian Kernel with Euclidean distance, along with practical examples of clustering student behaviors and engagement patterns in MOOCs.