• Corpus ID: 557525

Modeling Relational Data via Latent Factor Blockmodel

  title={Modeling Relational Data via Latent Factor Blockmodel},
  author={Sheng Gao and Ludovic Denoyer and Patrick Gallinari},
In this paper we address the problem of modeling relational data, which appear in many applications such as social network analysis, recommender systems and bioinformatics. Previous studies either consider latent feature based models but disregarding local structure in the network, or focus exclusively on capturing local structure of objects based on latent blockmodels without coupling with latent characteristics of objects. To combine the benefits of the previous work, we propose a novel model… 

Figures and Tables from this paper



Temporal link prediction by integrating content and structure information

A model which exploits multiple information sources in the network in order to predict link occurrence probabilities as a function of time is proposed, based on a matrix factorization formulation of the problem with graph regularization.

Sparse matrix-variate Gaussian process blockmodels for network modeling

This work proposes a new relational model for network data, Sparse Matrix-variate Gaussian process Blockmodel (SMGB), which generalizes popular bilinear generative models and captures nonlinear network interactions using a matrix-variations process with latent membership variables.

Predictive discrete latent factor models for large scale dyadic data

We propose a novel statistical method to predict large scale dyadic response variables in the presence of covariate information. Our approach simultaneously incorporates the effect of covariates and

Generalized Latent Factor Models for Social Network Analysis

This paper proposes a novel model, called generalized latent factor model (GLFM), for social network analysis by enhancing homophily modeling in MLFM, and devise a minorization-maximization (MM) algorithm with linear-time complexity and convergence guarantee to learn the model parameters.

Modelling Relational Data using Bayesian Clustered Tensor Factorization

The Bayesian Clustered Tensor Factorization (BCTF) model is introduced, which embeds a factorized representation of relations in a nonparametric Bayesian clustering framework that is fully Bayesian but scales well to large data sets.

Relational learning via collective matrix factorization

This model generalizes several existing matrix factorization methods, and therefore yields new large-scale optimization algorithms for these problems, which can handle any pairwise relational schema and a wide variety of error models.

A Log-Linear Model with Latent Features for Dyadic Prediction

  • A. MenonC. Elkan
  • Computer Science
    2010 IEEE International Conference on Data Mining
  • 2010
A new {log-linear} model for dyadic prediction that is the first to satisfy several important desiderata, and by using side-information it solves the cold-start problem in collaborative filtering.

Multiplicative latent factor models for description and prediction of social networks

A statistical model of social network data derived from matrix representations and symmetry considerations is discussed that allows for the graphical description of a social network via the latent factors of the nodes, and provides a framework for the prediction of missing links in network data.

Mixed Membership Stochastic Blockmodels

This paper describes a latent variable model of such data called the mixed membership stochastic blockmodel, which extends blockmodels for relational data to ones which capture mixed membership latent relational structure, thus providing an object-specific low-dimensional representation.

Stochastic Block Models of Mixed Membership

A novel “nested” variational inference scheme is developed, which is necessary to successfully perform fast approximate posterior inference in the authors' models of relational data, which combine features of mixed-membership and block models for relational data in a hierarchical Bayesian framework.