Skip to content

Bridging Academia and Industry: A Comprehensive Benchmark for Attributed Graph Clustering

Feb 2026 · arXiv.org · Vol abs/2602.08519 · 5 citations · 63 references
Computer Science

TL;DR

PyAGC is presented, a comprehensive, production-ready benchmark and library designed to stress-test AGC methods across diverse scales and structural properties and advocates for a holistic evaluation protocol that mandates unsupervised structural metrics and efficiency profiling alongside traditional supervised metrics.

Abstract

Attributed Graph Clustering (AGC) is a fundamental unsupervised task that integrates structural topology and node attributes to uncover latent patterns in graph-structured data. Despite its significance in industrial applications such as fraud detection and user segmentation, a significant chasm persists between academic research and real-world deployment. Current evaluation protocols suffer from the small-scale, high-homophily citation datasets, non-scalable full-batch training paradigms, and a reliance on supervised metrics that fail to reflect performance in label-scarce environments. To bridge these gaps, we present PyAGC, a comprehensive, production-ready benchmark and library designed to stress-test AGC methods across diverse scales and structural properties. We unify existing methodologies into a modular Encode-Cluster-Optimize framework and, for the first time, provide memory-efficient, mini-batch implementations for a wide array of state-of-the-art AGC algorithms. Our benchmark curates 12 diverse datasets, ranging from 2.7K to 111M nodes, specifically incorporating industrial graphs with complex tabular features and low homophily. Furthermore, we advocate for a holistic evaluation protocol that mandates unsupervised structural metrics and efficiency profiling alongside traditional supervised metrics. Battle-tested in high-stakes industrial workflows at Ant Group, this benchmark offers the community a robust, reproducible, and scalable platform to advance AGC research towards realistic deployment. The code and resources are publicly available via GitHub (https://github.com/Cloudy1225/PyAGC), PyPI (https://pypi.org/project/pyagc), and Documentation (https://pyagc.readthedocs.io). We invite readers to our latest survey (https://arxiv.org/abs/2603.20829) for the unified framework and industrial perspective that complement this benchmark.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Towards One-for-All Foundation Model for Attributed Graph Clustering

Attributed graph clustering aims to discover node groups by jointly exploiting node attributes and graph topology, yet its unsupervised nature makes model selection and adaptation inherently difficult. Existing methods typically train and tune a separate model for each input graph, leading to costly and fragile pipelin...

Yunhui Liu, Xu-Dong Jin, Kang Zhang et al. · 2 citations
#machine learning Preprint Sep 2026

SynCo: Synthetic Community-Aware Attributed Graph Generator for Graph Neural Network Benchmarking

This work introduces the Synthetic Community-Aware Attributed Graph Generator (SynCo), a graph generation algorithm that allows users to control the node degree distribution and sub-community structure and outperforms state-of-the-art approaches in synthetic graph generation and data augmentation.

Guilherme Henrique Messias, M. C. de Souza, Sylvia Iasulaitis et al. · 0 citations
Open access Oct 2026

Decoupled Feature Propagation and Structural Boosting: A Robust Framework for Node Classification on Heterophilous Graphs

Standard Graph Neural Networks (GNNs) frequently struggle with heterophilous structures where local proximity does not imply label similarity, leading to significant performance degradation due to signal oversmoothing. This study aimed to bridge the gap between theoretical complexity and empirical reliability by propos...

Heru Ismanto, I. Wayangkau · 0 citations
#artificial intelligence Preprint Sep 2026

GraphFAS: A Distributed System for Automated Graph Feature Generation and Selection in Industrial Transaction Networks

GraphFAS (Graph Feature Automated Selection), a distributed feature selection procedure based on Boruta that decouples feature aggregation from model training, enabling direct integration with tabular models and direct compatibility with TreeSHAPbased explanations.

Yi-Ce Luo, Yun Zhu, Xi Chen et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.