Graph Clustering Algorithms

GraphXD Seminar

XD

September 28, 2017
5:30pm to 7:00pm
1011 Evans Hall
Get Directions

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

Graphs Across Domains (GraphXD) is a BIDS working group that connects scientists, researchers, and theorists interested in graphs (networks) from a variety of fields (including mathematics, computer science, biology, physics, economics, and sociology) through seminars and workshops.

Speaker(s)

Tselil Schramm

Research Fellow
Simons Institute