SPONGE: A generalized eigenproblem for clustering signed networks

arXiv1904.08575MaRDI QIDQ6317400

Author name not available (Why is that?)

Publication date: 17 April 2019

Abstract: We introduce a principled and theoretically sound spectral method for $k$-way clustering in signed graphs, where the affinity measure between nodes takes either positive or negative values. Our approach is motivated by social balance theory, where the task of clustering aims to decompose the network into disjoint groups, such that individuals within the same group are connected by as many positive edges as possible, while individuals from different groups are connected by as many negative edges as possible. Our algorithm relies on a generalized eigenproblem formulation inspired by recent work on constrained clustering. We provide theoretical guarantees for our approach in the setting of a signed stochastic block model, by leveraging tools from matrix perturbation theory and random matrix theory. An extensive set of numerical experiments on both synthetic and real data shows that our approach compares favorably with state-of-the-art methods for signed clustering, especially for large number of clusters and sparse measurement graphs.

Has companion code repository: https://github.com/alan-turing-institute/signet

This page was built for publication: SPONGE: A generalized eigenproblem for clustering signed networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6317400)