scispace - formally typeset
Open AccessJournal ArticleDOI

Mixed Membership Stochastic Blockmodels

TLDR
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.
Abstract
Consider data consisting of pairwise measurements, such as presence or absence of links between pairs of objects. These data arise, for instance, in the analysis of protein interactions and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing pairwise measurements with probabilistic models requires special assumptions, since the usual independence or exchangeability assumptions no longer hold. Here we introduce a class of variance allocation models for pairwise measurements: mixed membership stochastic blockmodels. These models combine global parameters that instantiate dense patches of connectivity (blockmodel) with local parameters that instantiate node-specific variability in the connections (mixed membership). We develop a general variational inference algorithm for fast approximate posterior inference. We demonstrate the advantages of mixed membership stochastic blockmodels with applications to social networks and protein interaction networks.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A Scalable Redefined Stochastic Blockmodel

TL;DR: In this article, the authors propose a block-wise learning algorithm for stochastic block models (SBM) with Poisson distribution to reduce the cost of learning and make it scalable for handling large-scale networks.
Posted Content

Edgeworth expansions for network moments

Yuan Zhang, +1 more
TL;DR: It is shown that the Edgeworth expansion of a network moment statistic as a noisy U-statistic can achieve higher-order accuracy without non-lattice or smoothness assumptions but just requiring weak regularity conditions, and the two typically-hated factors in network analysis jointly play a blessing role.
Posted Content

Community detection with nodal information

Haolei Weng, +1 more
- 31 Oct 2016 - 
TL;DR: A flexible network model incorporating nodal information is proposed, and likelihood-based inference methods are developed that establish favorable asymptotic properties as well as efficient algorithms for computation.
Proceedings ArticleDOI

Provably Fast Inference of Latent Features from Networks: with Applications to Learning Social Circles and Multilabel Classification

TL;DR: This work proposes a probabilistic generative model with the property that the probability of an edge among two vertices is a non-decreasing function of the common features they possess and proposes the first provably rapidly mixing Markov chain for inferring latent features.
Journal ArticleDOI

Mixed-Membership of Experts Stochastic Blockmodel

TL;DR: The mixed membership of experts stochastic block model as mentioned in this paper is an extension to the original mixed membership block model, which incorporates covariate actor information into the existing model to allow actors membership to different groups, depending on the interaction in question.
References
More filters
Journal ArticleDOI

Gene Ontology: tool for the unification of biology

TL;DR: The goal of the Gene Ontology Consortium is to produce a dynamic, controlled vocabulary that can be applied to all eukaryotes even as knowledge of gene and protein roles in cells is accumulating and changing.
Journal ArticleDOI

Latent dirichlet allocation

TL;DR: This work proposes a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams, and Hofmann's aspect model.
Journal ArticleDOI

Finding scientific topics

TL;DR: A generative model for documents is described, introduced by Blei, Ng, and Jordan, and a Markov chain Monte Carlo algorithm is presented for inference in this model, which is used to analyze abstracts from PNAS by using Bayesian model selection to establish the number of topics.
Related Papers (5)