GraphXD Seminar: Graph Clustering Algorithms

Seminar | September 28 | 5:30-7 p.m. | 1011 Evans Hall

 Tselil Schramm, Simons Institute, UC Berkeley

 Berkeley Institute for Data Science

One of the greatest advantages of representing data with graphs is access to generic algorithms for analytic tasks, such as clustering. In this talk I will describe some popular graph clustering algorithms, and explain why they are well-motivated from a theoretical perspective.

 bids@berkeley.edu, 510-664-4506