Graph-level clustering stops crowding multi-class graphs into a few clusters: S3GLC adds spectral signatures for global topology and lifts REDDIT-12K accuracy by 14.6%
Graph-level clustering partitions a collection of graphs into semantically meaningful groups, but the widely used GIN encoder cannot see global topology, and deep clustering tends to collapse samples into a few clusters in multi-class settings. S3GLC uses a spectral signature, the sorted adjacency eigenvalues, as a rigorous lower bound on graph edit distance, fuses it with the GIN spatial representation, and enforces cluster balance through Sinkhorn-Knopp normalization from optimal transport. Across 10 real datasets and 15 baselines, it improves ACC by 14.6% on REDDIT-12K and NMI by 35.2% on DD.