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

Cluster and propensity based approximation of a network

TL;DR: The CPBA of a network is theoretically appealing since a) it generalizes correlation and multigraph network methods, b) it improves likelihood based significance tests for edge counts, c) it directly models higher-order relationships between clusters, and d) it suggests novel clustering algorithms.
Journal ArticleDOI

Estimating the effects of network covariates on subgroup insularity with a hierarchical mixed membership stochastic blockmodel

TL;DR: A new model is proposed that relates the amount of subgroup integration to network attributes, building on the mixed membership stochastic blockmodel and subsequent work by Sweet and Zheng (2017) and Sweet et al. (2014) and applied to determine the relationship between teachers’ instructional practices and their classrooms’ peer network subgroup structure.
Posted Content

Generalized Connectivity Matrix Response Regression with Applications in Brain Connectivity Studies

TL;DR: This article develops an efficient alternating gradient descent algorithm for parameter estimation, and establishes the non-asymptotic error bound for the actual estimator from the algorithm, which quantifies the interplay between the computational and statistical errors.
Posted Content

Stochastic blockmodels for exchangeable collections of networks

TL;DR: A novel class of stochastic blockmodels using Bayesian nonparametric mixtures allows us to jointly estimate the structure of multiple networks and explicitly compare the community structures underlying them, while allowing us to capture realistic properties of the underlying networks.
Book ChapterDOI

Community Dynamics: Event and Role Analysis in Social Network Analysis

TL;DR: An approach to analyzing community evolution events and entity role changes to uncover critical information in dynamic networks is discussed.
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)