University of Cambridge > > Artificial Intelligence Research Group Talks (Computer Laboratory) > Matrix Means for Signed and Multilayer Graph Clustering

Matrix Means for Signed and Multilayer Graph Clustering

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mateja Jamnik.

In this talk we present an extension of spectral clustering for the case when different kinds of interactions are present. We study suitable matrix functions to merge information that comes from different kinds of interactions encoded in multilayer graphs, and their effect in cluster identification. We consider a one-parameter family of matrix functions, known as matrix power means, and show that different means identify clusters 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 noise.

This talk is part of the Artificial Intelligence Research Group Talks (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity