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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Infinite multiple relational models for complex networks

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Senior Parlour, Gonville & Caius College via zoom (hopefully) Lecture Room 4, Department of Engineering, Trumpington Street, Cambridge CB2 1PZ

Other talks

CPH IRC and PHI CUSCRS and Renal Medicine Morning Break Theophilus Richmond’s The First Crossing: The Transition from Slavery to Indentureship in the Caribbean and the Case of the Black Slave on the Hesperus Topology of the Ritz energy landscape Title to be confirmed
 

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