paper-with-me

홈 › Papers

Stochastic Blockmodels with Edge Information

2019-04-03 · Guy W. Cole, Sinead A. Williamson

Stochastic blockmodels allow us to represent networks in terms of a latent community structure, often yielding intuitions about the underlying social structure. Typically, this structure is inferred based only on a binary network representing the presence or absence of interactions between nodes, which limits the amount of information that can be extracted from the data. In practice, many interaction networks contain much more information about the relationship between two nodes. For example, in an email network, the volume of communication between two users and the content of that communication can give us information about both the strength and the nature of their relationship. In this paper, we propose the Topic Blockmodel, a stochastic blockmodel that uses a count-based topic model to capture the interaction modalities within and between latent communities. By explicitly incorporating information sent between nodes in our network representation, we are able to address questions of interest in real-world situations, such as predicting recipients for an email message or inferring the content of an unopened email. Further, by considering topics associated with a pair of communities, we are better able to interpret the nature of each community and the manner in which it interacts with other communities.

📄 PDF Abstract BibTeX arXiv:1904.02016

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Clustering via Content-Augmented Stochastic Blockmodels

2015-05-25 · J. Massey Cashore, Xiaoting Zhao, Alexander A. Alemi, Yujia Liu 외

Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communi…

ArticlesClusteringCommunity Detection

Privacy Preserving Adjacency Spectral Embedding on Stochastic Blockmodels

2019-05-16 · Li Chen

For graphs generated from stochastic blockmodels, adjacency spectral embedding is asymptotically consistent. Further, adjacency spectral embedding composed with universally consistent classifiers is universally consisten…

Privacy Preserving

How Many Communities Are There?

2014-12-04 · Diego Franco Saldana, Yi Yu, Yang Feng

Stochastic blockmodels and variants thereof are among the most widely used approaches to community detection for social networks and relational data. A stochastic blockmodel partitions the nodes of a network into disjoin…

ClusteringCommunity DetectionModel Selection

Robust Vertex Classification

2013-11-23 · Li Chen, Cencheng Shen, Joshua Vogelstein, Carey Priebe

For random graphs distributed according to stochastic blockmodels, a special case of latent position graphs, adjacency spectral embedding followed by appropriate vertex classification is asymptotically Bayes optimal; but…

ClassificationGeneral ClassificationPosition

Scalable MCMC for Mixed Membership Stochastic Blockmodels

2015-10-16 · Wenzhe Li, Sungjin Ahn, Max Welling

We propose a stochastic gradient Markov chain Monte Carlo (SG-MCMC) algorithm for scalable inference in mixed-membership stochastic blockmodels (MMSB). Our algorithm is based on the stochastic gradient Riemannian Langevi…

Variational Inference