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

Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model

TL;DR: A Multiplicative Attribute Graph model is presented that considers nodes with categorical attributes and models the probability of an edge as the product of individual attribute link formation affinities, and a scalable variational expectation maximization parameter estimation method is developed.
Journal ArticleDOI

Parameter identifiability in a class of random graph mixture models

TL;DR: In this paper, the identifiability of parameters for a broad class of random graph mixture models has been investigated, which are characterized by a partition of the set of graph nodes into latent (unobservable) groups and connectivities between nodes are independent random variables when conditioned on the groups of the nodes being connected.
Journal ArticleDOI

Estimation of Monotone Treatment Effects in Network Experiments

TL;DR: In this paper, the authors propose new methods for finding confidence intervals on the attributable treatment effect in such settings, which do not require partial interference, but instead require an identifying assumption that is similar to requiring nonnegative treatment effects.
Journal ArticleDOI

Leveraging Artificial Intelligence in Business: Implications, Applications and Methods

TL;DR: The study analyses a corpus of 3780 contributions through an original combination of two established machine learning algorithms (LDA and hierarchical clustering) and produced a structured classification of the various streams of current research and a list of promising emerging trends.
Journal ArticleDOI

Network sampling and classification: An investigation of network model representations

TL;DR: It is argued that conclusions based on simulated network studies must focus on the full features of the connectivity patterns of a network instead of on the limited set of network metrics for a specific network type.
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)