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
Posted Content

Consistency of adjacency spectral embedding for the mixed membership stochastic blockmodel

TL;DR: In this paper, the authors show that adjacency spectral embedding into a convex polytope, followed by fitting the minimum volume enclosing convex $k$-polytope to the $k-1$ principal components, leads to a consistent estimate of a community mixed membership stochastic blockmodel.

Scalable Methods for Graph-Based Unsupervised and Semi-Supervised Learning

Frank Lin
TL;DR: It is shown how these methods can be efficiently extended to work on non-graph data, and their application and effectiveness on a wide variety of datasets that includes social and citation networks, political blogs, document collections, noun phrase-context co-occurrences, and geolocations.
Posted Content

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching

TL;DR: In this article, it was shown that the performance of the maximum likelihood (ML)-based vertex-nomination algorithm asymptotically matches that of the Bayes optimal algorithm.
Proceedings Article

User group oriented temporal dynamics exploration

TL;DR: GrosToT uncovers the interplay between group interest and temporal dynamics, and significantly outperforms state-of-the-art dynamics modeling methods.
Patent

Systems and methods for genotyping with graph reference

Richard Brown
TL;DR: In this article, a reference graph is transformed into a traversal graph in which a path represents a diploid genotype, and a path through a series of connected nodes and edges represents a genetic sequence.
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)