Stochastic Block Models with Multiple Continuous Attributes
Not on the map. Why?
Abstract (arXiv)
The stochastic block model (SBM) is a probabilistic model for community structure in networks. Typically, only the adjacency matrix is used to perform SBM parameter inference. In this paper, we consider circumstances in which nodes have an associated vector of continuous attributes that are also used to learn the node-to-community assignments and corresponding SBM parameters. While this assumption is not realistic for every application, our model assumes that the attributes associated with the nodes in a network's community can be described by a common multivariate Gaussian model. In this augmented, attributed SBM, the objective is to simultaneously learn the SBM connectivity probabilities with the multivariate Gaussian parameters describing each community. While there are recent examples in the literature that combine connectivity and attribute information to inform community detection, our model is the first augmented stochastic block model to handle multiple continuous attributes. This provides the flexibility in biological data to, for example, augment connectivity information with continuous measurements from multiple experimental modalities. Because the lack of labeled network data often makes community detection results difficult to validate, we highlight the usefulness of our model for two network prediction tasks: link prediction and collaborative filtering. As a result of fitting this attributed stochastic block model, one can predict the attribute vector or connectivity patterns for a new node in the event of the complementary source of information (connectivity or attributes, respectively). We also highlight two biological examples where the attributed stochastic block model provides satisfactory performance in the link prediction and collaborative filtering tasks.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Mar 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 4; 2025: 1; 2026: 1.
11 papers.
- 2021An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guaranteescited by 10
- 2023Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic Block Modelcited by 7
- 2021Semi-Supervised Clustering with Inaccurate Pairwise Annotationscited by 2
- 2024Flexible inference in heterogeneous and attributed multilayer networkscited by 2
- 2025Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Modelscited by 2
- 2024Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Modelscited by 1
- 2021Node metadata can produce predictability transitions in network inference problemscited by 0
- 2022Reconstructing Sparse Multiplex Networks with Application to Covert Networkscited by 0
- 2024Multi-view clustering integrating anchor attribute and structural informationcited by 0
- 2024Deep Sparse Latent Feature Models for Knowledge Graph Completioncited by 0
- 2026Clustering Node Attributed Networks with Graph Neural Networks and Self Learningcited by 0
- 2026Clustering Node Attributed Networks with Graph Neural Networks and Self Learning11 Jun 2026
- 2025Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models11 Feb 2025
- 2024Deep Sparse Latent Feature Models for Knowledge Graph Completion24 Nov 2024
- 2024Multi-view clustering integrating anchor attribute and structural information29 Oct 2024
- 2024Flexible inference in heterogeneous and attributed multilayer networks31 May 2024
- 2024Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Models1 Jan 2024
- 2023Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic Block Model30 Oct 2023
- 2022Reconstructing Sparse Multiplex Networks with Application to Covert Networks29 Jul 2022
- 2021An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees20 Dec 2021
- 2021Semi-Supervised Clustering with Inaccurate Pairwise Annotations5 Apr 2021
- 2021Node metadata can produce predictability transitions in network inference problems26 Mar 2021