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

Community Discovery via Metagraph Factorization

TL;DR: The proposed MetaFac (MetaGraph Factorization), a framework that extracts community structures from dynamic, multidimensional social contexts and interactions, is proposed, suggesting that the technique is scalable and is able to extract meaningful communities from social media contexts.
Journal ArticleDOI

Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering

TL;DR: This is the first work that clusters large evolutionary data sets by the amalgamation of low-rank matrix approximation methods and matrix factorization-based clustering, and mathematically proves the convergence and correctness of ECKF and provides detailed analysis of its computational efficiency.
Proceedings ArticleDOI

Link Prediction with Signed Latent Factors in Signed Social Networks

TL;DR: The proposed SLF model considers four types of relationships: positive, negative, neutral and no relationship at all, and links social relationships of different types to the comprehensive, but opposite, effects of positive and negative SLFs.
Journal ArticleDOI

Combined node and link partitions method for finding overlapping communities in complex networks

TL;DR: This work proposes a new unified model and method for finding the best overlapping communities on the basis of the associated node and link partitions derived from the same framework and introduces a model selection method based on consensus clustering to determine the number of communities.
Posted Content

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

TL;DR: This work proposes a computationally efficient spectral algorithm that allows for asymptotically correct inference when the average node degree could be as low as logarithmic in the total number of nodes and shows that no algorithm can achieve better inference than guessing without using the observations.
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)