Published in

2011 IEEE International Workshop on Machine Learning for Signal Processing

DOI: 10.1109/mlsp.2011.6064546

Links

Tools

Export citation

Search in Google Scholar

Infinite Multiple Membership Relational Modeling for Complex Networks

Journal article published in 2011 by Morten Mørup ORCID, Mikkel Nørgaard Schmidt, Lars Kai Hansen
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Learning latent structure in complex networks has become an important problem fueled by many types of networked data originating from practically all fields of science. In this paper, we propose 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 admitting multiple-membership analysis in large scale networks. We demonstrate a connection between the single membership relational model and multiple membership models and show on "real" size benchmark network data that accounting for multiple memberships improves the learning of latent structure as measured by link prediction while explicitly accounting for multiple membership result in a more compact representation of the latent structure of networks. ; Comment: 8 pages, 4 figures