Skip Navigation

Learning latent block structure in weighted networks

  1. Christopher Aicher
  1. Department of Applied Mathematics, University of Colorado, Boulder, CO 80309, USA
  1. Corresponding author. Email: christopher.aicher@colorado.edu
  1. Abigail Z. Jacobs
  1. Department of Computer Science, University of Colorado, Boulder, CO 80309, USA
  1. Aaron Clauset

+ Author Affiliations

  1. Department of Computer Science, University of Colorado, Boulder, CO 80309, USA, BioFrontiers Institute, University of Colorado, Boulder, CO 80303, USA and Santa Fe Institute, Santa Fe, NM 87501, USA
  1. Edited by: Ernesto Estrada

  • Received April 1, 2014.
  • Accepted May 27, 2014.

Abstract

Community detection is an important task in network analysis, in which we aim to learn a network partition that groups together vertices with similar community-level connectivity patterns. By finding such groups of vertices with similar structural roles, we extract a compact representation of the network's large-scale structure, which can facilitate its scientific interpretation and the prediction of unknown or future interactions. Popular approaches, including the stochastic block model (SBM), assume edges are unweighted, which limits their utility by discarding potentially useful information. We introduce the weighted stochastic block model (WSBM), which generalizes the SBM to networks with edge weights drawn from any exponential family distribution. This model learns from both the presence and weight of edges, allowing it to discover structure that would otherwise be hidden when weights are discarded or thresholded. We describe a Bayesian variational algorithm for efficiently approximating this model's posterior distribution over latent block structures. We then evaluate the WSBM's performance on both edge-existence and edge-weight prediction tasks for a set of real-world weighted networks. In all cases, the WSBM performs as well or better than the best alternatives on these tasks.

Key words

| Table of Contents

This Article

  1. jcomplexnetw 3 (2): 221-248. doi: 10.1093/comnet/cnu026
  1. All Versions of this Article:
    1. cnu026v1
    2. 3/2/221 most recent

- Share

Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.