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

Detecting Overlapping Communities in Networks Using Spectral Methods

TL;DR: In this article, a general, flexible, and interpretable framework for community detection in overlapping communities is proposed, which can detect overlapping communities in a more realistic case of overlapping communities.
Journal ArticleDOI

Accurate and scalable social recommendation using mixed-membership stochastic block models

TL;DR: This work has developed a rigorous probabilistic model that outperforms leading approaches for recommendation and whose parameters can be fitted efficiently with an algorithm whose running time scales linearly with the size of the dataset.
Journal ArticleDOI

Probabilistic Community Detection With Unknown Number of Communities

TL;DR: A fundamental problem in network analysis is clustering the nodes into groups which share a similar connectivity pattern as discussed by the authors, and existing algorithms for community detection assume the knowledge of the num....
Proceedings Article

Nonparametric Multi-group Membership Model for Dynamic Networks

TL;DR: This work proposes a nonparametric multi-group membership model for dynamic networks that captures the evolution of individual node group memberships via a Factorial Hidden Markov model and explains the dynamics of the network structure by explicitly modeling the connectivity structure of groups.
Journal ArticleDOI

Revisiting the complex adaptive systems paradigm: Leading perspectives for researching operations and supply chain management issues

TL;DR: This paper introduces the articles that are part of this special issue and presents a conceptual model for a renewed consideration of the complex adaptive systems (CAS) perspective in operations and supply chain management research.
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)