MLLGMar 1, 2019

A Review of Stochastic Block Models and Extensions for Graph Clustering

arXiv:1903.00114v2251 citations
Originality Synthesis-oriented
AI Analysis

This is an incremental review paper aimed at practitioners needing a summary of current graph clustering methods.

The paper reviews stochastic block models and their extensions for graph clustering, summarizing different approaches and comparing how they handle various issues to provide a concise overview for practitioners.

There have been rapid developments in model-based clustering of graphs, also known as block modelling, over the last ten years or so. We review different approaches and extensions proposed for different aspects in this area, such as the type of the graph, the clustering approach, the inference approach, and whether the number of groups is selected or estimated. We also review models that combine block modelling with topic modelling and/or longitudinal modelling, regarding how these models deal with multiple types of data. How different approaches cope with various issues will be summarised and compared, to facilitate the demand of practitioners for a concise overview of the current status of these areas of literature.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes