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

Bayesian Discovery of Threat Networks

TL;DR: In this article, a new Bayesian network detection framework is introduced that partitions the graph based on prior information and direct observations, and the new approach, called space-time threat propagation, is proved to maximize the probability of detection and is therefore optimum in the Neyman-Pearson sense.
Journal ArticleDOI

Attributed graph clustering with subspace stochastic block model

TL;DR: This paper proposes a subspace stochastic block model (SSB) to explore the cluster structures in attributed graphs and views both topological structure and attribute information as the latent factors to drive the formation of clusters in the new proposed generative model.
Journal ArticleDOI

struc2gauss : Structural role preserving network embedding via Gaussian embedding

TL;DR: A new NE framework is proposed, struc2gauss, which learns node representations in the space of Gaussian distributions and performs network embedding based on global structural information and outperforms other methods on the structure-based clustering and classification task and provides more information on uncertainties of node representations.
Proceedings Article

Preferential Attachment in Graphs with Affinities

TL;DR: A random graph model based on both node attributes and preferential attachment is proposed that preserves the power law behavior in the degree distribution as expressed by natural graphs and it is analytically proved that it preserves the small world property.
Posted Content

Latent Point Process Models for Spatial-Temporal Networks

TL;DR: This work develops an efficient approximate algorithm based on variational expectationmaximization to infer unknown participants in an event given the location and the time of the event.
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)