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
Proceedings ArticleDOI

Detecting cohesive and 2-mode communities indirected and undirected networks

TL;DR: In this paper, a novel overlapping community detection method that scales to networks of millions of nodes and edges and advances research along two dimensions: the connectivity structure of communities, and the use of edge directedness for community detection.
Posted Content

Community Detection in Networks: The Leader-Follower Algorithm

TL;DR: The leader-follower algorithm is proposed which is based upon the natural internal structure expected of communities in social networks and can resolve a finer community structure in dense networks than common spectral clustering methods based on external community structure.
Book ChapterDOI

Mixed Membership Matrix Factorization

TL;DR: In this article, a fully Bayesian framework for integrating discrete mixed membership and continuous latent factor models into unified Mixed Membership Matrix Factorization (M3F) models is developed, and two M3F models, derived Gibbs sampling inference procedures, are introduced and validated on the EachMovie, MovieLens, and Netflix Prize collaborative filtering datasets.
Posted Content

Fast Detection of Overlapping Communities via Online Tensor Methods

TL;DR: In this article, a tensor-based approach for detecting hidden overlapping communities under the Mixed Membership Stochastic Blockmodel (MMSB) is presented, which exploits the parallelism of SIMD architectures and a CPU-based implementation for larger datasets.
Posted Content

Discrete Temporal Models of Social Networks

TL;DR: The authors propose a family of statistical models for social network evolution over time, which represent an extension of Exponential Random Graph Models (ERGMs) and give examples of their use for hypothesis testing and classification.
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)