Open AccessProceedings Article
Dynamic Probabilistic Models for Latent Feature Propagation in Social Networks
Creighton Heaukulani,Zoubin Ghahramani +1 more
- pp 275-283
TLDR
A new probabilistic model for capturing this phenomenon, which is called latent feature propagation, in social networks, is introduced and its capability for inferring such latent structure in varying types of social network datasets is demonstrated.Abstract:
Current Bayesian models for dynamic social network data have focused on modelling the influence of evolving unobserved structure on observed social interactions. However, an understanding of how observed social relationships from the past affect future unobserved structure in the network has been neglected. In this paper, we introduce a new probabilistic model for capturing this phenomenon, which we call latent feature propagation, in social networks. We demonstrate our model's capability for inferring such latent structure in varying types of social network datasets, and experimental studies show this structure achieves higher predictive performance on link prediction and forecasting tasks.read more
Citations
More filters
Posted Content
Statistical clustering of temporal networks through a dynamic stochastic block model
Catherine Matias,Vincent Miele +1 more
TL;DR: In this paper, the authors explore statistical properties and frequentist inference in a model that combines a stochastic block model (SBM) for its static part with independent Markov chains for the evolution of the nodes groups through time.
Proceedings Article
Consistent estimation of dynamic and multi-layer block models
TL;DR: The asymptotic properties of two estimators for the multi-graph SBM, namely spectral clustering and the maximum-likelihood estimate (MLE), are explored and a variational approximation to the MLE that is computationally feasible for large networks is proposed.
Journal ArticleDOI
Modeling Temporal Activity Patterns in Dynamic Social Networks
TL;DR: In this paper, a coupled hidden Markov model (HMM) is proposed to predict the time to the next tweet by incorporating the social network influence as perceived by the user.
Posted Content
Stochastic Block Transition Models for Dynamic Networks
TL;DR: In this paper, a stochastic block transition model (SBTM) for dynamic networks is proposed, which is inspired by the well-known SBM for static networks and previous dynamic extensions of the SBM.
Proceedings Article
Stochastic Block Transition Models for Dynamic Networks
TL;DR: In this article, a stochastic block transition model (SBTM) for dynamic networks is proposed, which is inspired by the well-known SBM for static networks and previous dynamic extensions of SBM.
References
More filters
Journal ArticleDOI
Hierarchical Dirichlet Processes
TL;DR: This work considers problems involving groups of data where each observation within a group is a draw from a mixture model and where it is desirable to share mixture components between groups, and considers a hierarchical model, specifically one in which the base measure for the childDirichlet processes is itself distributed according to a Dirichlet process.
Journal ArticleDOI
Latent Space Approaches to Social Network Analysis
TL;DR: This work develops a class of models where the probability of a relation between actors depends on the positions of individuals in an unobserved “social space,” and proposes Markov chain Monte Carlo procedures for making inference on latent positions and the effects of observed covariates.
Journal ArticleDOI
Mixed Membership Stochastic Blockmodels
TL;DR: In this article, the authors introduce a class of variance allocation models for pairwise measurements, called mixed membership stochastic blockmodels, which combine global parameters that instantiate dense patches of connectivity (blockmodel) with local parameters (mixed membership), and develop a general variational inference algorithm for fast approximate posterior inference.
Posted Content
Mixed membership stochastic blockmodels
TL;DR: The mixed membership stochastic block model as discussed by the authors extends block models for relational data to ones which capture mixed membership latent relational structure, thus providing an object-specific low-dimensional representation.
Journal ArticleDOI
Factorial Hidden Markov Models
TL;DR: A generalization of HMMs in which this state is factored into multiple state variables and is therefore represented in a distributed manner, and a structured approximation in which the the state variables are decoupled, yielding a tractable algorithm for learning the parameters of the model.