About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

Bayesian latent feature modeling for modeling bipartite networks with overlapping groups

In Proceedings of the Ieee International Workshop on Machine Learning for Signal Processing (mlsp 2016) — 2016, pp. 1-6
From

Technical University of Denmark1

Department of Applied Mathematics and Computer Science, Technical University of Denmark2

Cognitive Systems, Department of Applied Mathematics and Computer Science, Technical University of Denmark3

Bi-partite networks are commonly modelled using latent class or latent feature models. Whereas the existing latent class models admit marginalization of parameters specifying the strength of interaction between groups, existing latent feature models do not admit analytical marginalization of the parameters accounting for the interaction strength within the feature representation.

We propose a new binary latent feature model that admits analytical marginalization of interaction strengths such that model inference reduces to assigning nodes to latent features. We propose a constraint inspired by the notion of community structure such that the edge density within groups is higher than between groups.

Our model further assumes that entities can have different propensities of generating links in one of the modes. The proposed framework is contrasted on both synthetic and real bi-partite networks to the infinite relational model and the infinite Bernoulli mixture model. We find that the model provides a new latent feature representation of structure while in link-prediction performing close to existing models.

Our current extension of the notion of communities and collapsed inference to binary latent feature representations in bipartite networks provides a new framework for accounting for structure in bi-partite networks using binary latent feature representations providing interpretable representations that well characterize structure as quantified by link prediction.

Language: English
Publisher: IEEE
Year: 2016
Pages: 1-6
Proceedings: 2016 IEEE 26th International Workshop on Machine Learning for Signal Processing
ISBN: 1509007466 , 1509007474 , 9781509007462 and 9781509007479
Types: Conference paper
DOI: 10.1109/MLSP.2016.7738845
ORCIDs: Mørup, Morten , Schmidt, Mikkel Nørgaard and Herlau, Tue

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis