35. Finding Clusters in Graphs

From the creator

MIT 18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning, Spring 2018 Instructor: Gilbert Strang View the complete course: https://ocw.mit.edu/18-065S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63oMNUHXqIUcrkS2PivhN3k The topic of this lecture is clustering for graphs, meaning finding sets of 'related' vertices in graphs. The challenge is finding good algorithms to optimize cluster quality. Professor Strang reviews some possibilities. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu

Published 2019-05-16 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.