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
Citations
More filters
Journal ArticleDOI
Kvasir: Scalable Provision of Semantically Relevant Web Content on Big Data Framework
TL;DR: This work builds Kvasir, a semantic recommendation system on top of latent semantic analysis and other state-of-the-art technologies to seamlessly integrate an automated and proactive content provision service into web browsing, and improves the classic randomized partition tree to support efficient indexing and searching of millions of documents.
Posted Content
Model selection and clustering in stochastic block models with the exact integrated complete data likelihood
E. Côme,P. Latouche +1 more
TL;DR: An analytical expression can be derived for the integrated complete data log likelihood and an inference algorithm is proposed to maximize this exact quantity and can be employed to analyze large networks with ten thousand nodes.
Journal ArticleDOI
An interpretable approach for social network formation among heterogeneous agents.
TL;DR: A social network formation model that integrates methods in multiple disciplines and retain both heterogeneity and interpretability is proposed that contributes to the literature on network formation by combining the methods in game theory, agent-based modeling, machine learning, and computational sociology.
Journal ArticleDOI
A survey on theoretical advances of community detection in networks
TL;DR: A survey on the recent theoretical advances of community detection can be found in this paper, where a number of different community detection methods and their theoretical properties are reviewed, including graph cut methods, profile likelihoods, the pseudo-likelihood method, the variational method, belief propagation, spectral clustering, and semidefinite relaxations of the stochastic blockmodel.
Journal ArticleDOI
Detection of structurally homogeneous subsets in graphs
TL;DR: Methods for detecting communities in undirected graphs have been recently reviewed by Fortunato and a review of methods and algorithms for detecting essentially structurally homogeneous subsets of vertices in binary or weighted and directed and undirecting graphs is made.
References
More filters
Journal ArticleDOI
Maximum likelihood from incomplete data via the EM algorithm
Journal ArticleDOI
Gene Ontology: tool for the unification of biology
M Ashburner,Catherine A. Ball,Judith A. Blake,David Botstein,Heather Butler,J. M. Cherry,Allan Peter Davis,Kara Dolinski,Selina S. Dwight,J.T. Eppig,Midori A. Harris,David P. Hill,Laurie Issel-Tarver,Andrew Kasarskis,Suzanna E. Lewis,John C. Matese,Joel E. Richardson,M. Ringwald,Gerald M. Rubin,Gavin Sherlock +19 more
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.
Journal ArticleDOI
Functional organization of the yeast proteome by systematic analysis of protein complexes
Anne-Claude Gavin,Markus Bösche,Roland Krause,Paola Grandi,Martina Marzioch,Andreas Bauer,Jörg Schultz,Jens Rick,Anne-Marie Michon,Cristina-Maria Cruciat,Marita Remor,Christian Höfert,Malgorzata Schelder,Miro Brajenovic,Heinz Ruffner,Alejandro Merino,Karin Klein,Manuela Hudak,David Dickson,Tatjana Rudi,Volker Gnau,Angela Bauch,Sonja Bastuck,Bettina Huhse,Christina Leutwein,Marie-Anne Heurtier,Richard R. Copley,Angela Edelmann,Erich Querfurth,Vladimir Rybin,Gerard Drewes,Manfred Raida,Tewis Bouwmeester,Peer Bork,Bertrand Séraphin,Bernhard Kuster,Gitte Neubauer,Giulio Superti-Furga +37 more
TL;DR: The analysis provides an outline of the eukaryotic proteome as a network of protein complexes at a level of organization beyond binary interactions, which contains fundamental biological information and offers the context for a more reasoned and informed approach to drug discovery.