PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Infinite multiple membership relational modeling for complex networks
Mikkel N. Schmidt, Morten Mørup and Lars Kai Hansen
In: Machine Learning for Signal Processing, IEEE International Workshop on (MLSP)(2011).


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 member-ship result in a more compact representation of the latent structure of networks.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:9216
Deposited By:Mikkel Schmidt
Deposited On:21 February 2012