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 multiplemembership 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.
|Title of host publication||2011 IEEE International Workshop on Machine Learning for Signal Processing (MLSP)|
|Publication status||Published - 2011|
|Event||2011 IEEE International Workshop on Machine Learning for Signal Processing - Beijing, China|
Duration: 18 Sep 2011 → 21 Sep 2011
Conference number: 21
|Conference||2011 IEEE International Workshop on Machine Learning for Signal Processing|
|Period||18/09/2011 → 21/09/2011|