mlsanityData to 14 Oct 2026

The Feature-First Block Model

arXiv 2105.13762 ↗First posted 28 May 2021cs.LG cs.SI stat.APcited by 0

Not on the map. Why?

Abstract (arXiv)

Labelled networks are an important class of data, naturally appearing in numerous applications in science and engineering. A typical inference goal is to determine how the vertex labels (or features) affect the network's structure. In this work, we introduce a new generative model, the feature-first block model (FFBM), that facilitates the use of rich queries on labelled networks. We develop a Bayesian framework and devise a two-level Markov chain Monte Carlo approach to efficiently sample from the relevant posterior distribution of the FFBM parameters. This allows us to infer if and how the observed vertex-features affect macro-structure. We apply the proposed methods to a variety of network data to extract the most important features along which the vertices are partitioned. The main advantages of the proposed approach are that the whole feature-space is used automatically and that features can be rank-ordered implicitly according to impact.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 14 references that are in the map. First posted on arXiv 28 May 2021.

Builds on

2 of 14 references.

References · 2

  1. 2013Efficient Monte Carlo and greedy heuristic for the inference of stochastic block modelscited by 29
  2. 2016Nonparametric Bayesian inference of the microcanonical stochastic block modelcited by 21

Built on by

Not cited yet.