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

HHMF: hidden hierarchical matrix factorization for recommender systems

TL;DR: A Hidden Hierarchical Matrix Factorization technique, which learns the hidden hierarchical structure from the user-item rating records, and outperforms existing methods, demonstrating that the discovery of latent hierarchical structures indeed improves the quality of recommendation.
Proceedings Article

Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results

TL;DR: In this paper, the authors proposed a spectral algorithm to infer the edge label distribution from a partially observed network. But the algorithm requires the average node degree to be as low as logarithmic in the total number of nodes.
Journal ArticleDOI

A Correlated Random Effects Model for Nonignorable Missing Data in Value-Added Assessment of Teacher Effects

TL;DR: In this paper, value-added models have been widely used to assess the contributions of individual teachers and schools to students' academic growth based on longitudinal student achievement outcomes, and there is con...
Posted Content

Comparison of Cross-Validation Methods for Stochastic Block Models

Beau Dabbs, +1 more
- 10 May 2016 - 
TL;DR: Overall, latinCV performs more accurate model selection, and avoids overfitting better than any of the other model selection methods considered.
Posted Content

Vertex Nomination Via Seeded Graph Matching

TL;DR: This work presents a principled methodology appropriate for situations in which the networks are too large/noisy for brute‐force graph matching, and identifies Vertices in a local neighborhood of the VOIs in the first network that have verifiable corresponding vertices in the second network.
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)