BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Matrix Means for Signed and Multilayer Graph Clustering - Pedro Me
 rcado (University of Tübingen)
DTSTART:20191112T130000Z
DTEND:20191112T140000Z
UID:TALK133837@talks.cam.ac.uk
CONTACT:Mateja Jamnik
DESCRIPTION:In this talk we present an extension of spectral clustering fo
 r the case when different kinds of interactions are present. We study suit
 able matrix functions to merge information that comes from different kinds
  of interactions encoded in multilayer graphs\, and their effect in cluste
 r identification. We consider a one-parameter family of matrix functions\,
  known as matrix power means\, and show that different means identify clus
 ters under different settings of the stochastic block model in expectation
 . For instance\, we show that a limit case identifies clusters if at least
  one layer is informative and the remaining layers are potentially just no
 ise.
LOCATION:SS03\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR