University of Cambridge > > Machine Learning Reading Group @ CUED > Infinite multiple relational models for complex networks

Infinite multiple relational models for complex networks

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

If you have a question about this talk, please contact Shakir Mohamed.

Learning latent structure in complex networks is an important problem that has many application areas. In this talk I present a new non-parametric Bayesian multiple-membership latent feature model for networks. Contrary to existing multiple-membership models that scale quadratically in the number of vertices, the proposed model scales linearly in the number of links. I present an efficient split-merge inference procedure that significantly outperform standard Gibbs sampling.

This talk is part of the Machine Learning Reading Group @ CUED 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