An Infinite Latent Attribute Model for Network Data

Abstract

Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes then depends only on their cluster assignment. Currently available models can be classified by whether clusters are disjoint or are allowed to overlap. These models can explain a "flat" clustering structure. Hierarchical Bayesian models provide a natural approach to capture more complex dependencies. We propose a model in which objects are characterised by a latent feature vector. Each feature is itself partitioned into disjoint groups (subclusters), corresponding to a second layer of hierarchy. In experimental comparisons, the model achieves significantly improved predictive performance on social and biological link prediction tasks. The results indicate that models with a single layer hierarchy over-simplify real networks.

Appears in Proceedings of the 29th International Conference on Machine Learning (ICML 2012)

References in corpus (2)

• Community structure in social and biological networks
• Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model

Cited by in corpus (14)

• Sparse graphs using exchangeable random measures
• Non-parametric Bayesian modeling of complex networks
• Nonparametric Multi-group Membership Model for Dynamic Networks
• Joint Inference of Multiple Label Types in Large Networks
• Node Embeddings and Exact Low-Rank Representations of Complex Networks
• Completely random measures for modeling power laws in sparse graphs
• Independent finite approximations for Bayesian nonparametric inference
• Priors on exchangeable directed graphs
• Collapsed Variational Bayes Inference of Infinite Relational Model
• Bayesian Models for Heterogeneous Personalized Health Data
• Non-exchangeable feature allocation models with sublinear growth of the feature sizes
• Homophily and Triadic Closure in Evolving Social Networks
• One-class Collaborative Filtering with Random Graphs: Annotated Version
• Scalable Deep Generative Relational Models with High-Order Node Dependence