Spectral Clustering for Directed Graphs via Likelihood Estimation on Stochastic Block Models

TL;DR

This paper introduces a novel spectral clustering algorithm for directed graphs based on likelihood estimation under stochastic block models, with theoretical guarantees and superior performance demonstrated on synthetic and real data.

Contribution

It develops a new spectral clustering method for directed graphs guided by maximum likelihood estimation, with theoretical error bounds and adaptive features.

Findings

The method achieves lower misclustering errors than existing algorithms.

Theoretical upper bounds on misclustering error are established.

Experimental results show significant performance improvements.

Abstract

Graph clustering is a fundamental task in unsupervised learning with broad real-world applications. While spectral clustering methods for undirected graphs are well-established and guided by a minimum cut optimization consensus, their extension to directed graphs remains relatively underexplored due to the additional complexity introduced by edge directions. In this paper, we leverage statistical inference on stochastic block models to guide the development of a spectral clustering algorithm for directed graphs. Specifically, we study the maximum likelihood estimation under a widely used directed stochastic block model, and derive a global objective function that aligns with the underlying community structure. We further establish a theoretical upper bound on the misclustering error of its spectral relaxation, and based on this relaxation, introduce a novel, self-adaptive spectral clustering method for directed graphs. Extensive experiments on synthetic and real-world datasets demonstrate significant performance gains over existing baselines.