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

Spatial modeling of brain connectivity data via latent distance models with nodes clustering

TL;DR: This work proposes a predictor‐dependent latent space model for replicated brain network data which allows for flexible inference on brain network patterns which are not explained by the anatomical structure, and facilitates clustering among brain regions according to local similarities in the latent space.
Book ChapterDOI

On Joint Modeling of Topical Communities and Personal Interest in Microblogs

TL;DR: This paper proposes the Topical Communities and Personal Interest (TCPI) model, a model for simultaneously modeling topics, topical communities, and users’ topical interests in microblogging data and demonstrates that TCPI significantly outperforms other state-of-the-art topic models in the modeling tweet generation task.
Posted Content

Max-Margin Nonparametric Latent Feature Models for Link Prediction

TL;DR: This approach attempts to unite the ideas of max-margin learning and Bayesian nonparametrics to discover discriminative latent features for link prediction, and inherits the advances of nonparametric Bayesian methods to infer the unknown latent social dimension.
Book ChapterDOI

Interactions in information spread: quantification and interpretation using stochastic block models.

TL;DR: A new model is proposed, the Interactive Mixed Membership Stochastic Block Model (IMMSBM), which investigates the role of interactions between entities and quantifies their importance within the aforementioned corpora and finds that interactions play an important role in those corpora.
Posted Content

Exact tests for stochastic block models

TL;DR: A finite-sample goodness-of-fit test for latent block assignment model test for stochastic block models for networks and extends to any mixture of log-linear models on discrete data.
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)