The paper introduces S$^3$GLC, a deep graph-level clustering framework that combines global topological features—derived via a Spectral Signature based on the Hoffman-Wielandt inequality—with local neighborhood information to improve clustering of graph datasets. It also incorporates a joint manifold-preserving sparse regression module to fuse these representations while reducing noise, and a balanced clustering objective using optimal transport to prevent clustering collapse, especially in imbalanced multi-class settings. Experiments on ten real-world datasets, including REDDIT-12K and OGBG-PPA, show that S$^3$GLC outperforms fifteen state-of-the-art baselines.
Given a collection of $N$ graphs, graph-level clustering (GLC) seeks to partition the $N$ graphs into semantically meaningful groups, which serves as a fundamental task in analyzing graph-structured d...
arXiv:2609.17061v1 Announce Type: cross Abstract: Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn g...
Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn graph representations. However, their discriminative...
arXiv:2606. 24237v1 Announce Type: new Abstract: Federated Graph Learning facilitates collaborative graph modeling across distributed clients while preserving data privacy.
arXiv:2609.26063v1 Announce Type: new Abstract: Federated graph learning (FGL) enables multiple clients to collaboratively train graph models without sharing their private graph data, providing a pro...
The paper introduces OFAG, a foundation model designed for attributed graph clustering that can be trained once and applied to diverse graphs without graph‑specific tuning. It learns a reusable clustering strategy from synthetic graphs and uses a dimension‑agnostic encoder to handle varying feature spaces, producing clustering‑friendly node representations in a single forward pass. Across ten datasets, a frozen OFAG model outperforms baselines in both speed and clustering quality, and the authors provide code and pretrained checkpoints for easy adoption.
SCARCE is a label‑free representation‑learning framework that improves graph‑level out‑of‑distribution generalization. It uses an environment partition of training graphs—derived from metadata or self‑supervised clustering—to warm‑start a variational graph autoencoder and then applies an adversarial confusion mechanism that prevents a discriminator from distinguishing environments while preserving reconstruction fidelity. Theoretical analysis shows that this environment confusion contracts environment‑discriminative directions, effectively reweighting features to reduce reliance on spurious correlations, and experiments on synthetic and DrugOOD datasets demonstrate state‑of‑the‑art OOD performance among label‑free methods.
Graph-level out-of-distribution (OOD) generalization is critical for deploying graph neural networks in real-world applications where distribution shifts are inevitable. Existing approaches typically...
arXiv:2605. 28209v2 Announce Type: replace Abstract: Graph clustering is essential in graph analysis for revealing structural patterns and node communities.
arXiv:2607. 24338v1 Announce Type: new Abstract: Unsupervised graph representation learning aims to derive meaningful node embeddings by capturing both structural and attribute information without relying on labeled data.
arXiv:2607. 03587v1 Announce Type: new Abstract: We propose NetinfoGC, a framework for graph classification that extends the Network Usable Information (NUI) paradigm to graph-level learning.
The paper introduces three hierarchical frameworks for community detection in complex networks, integrating linkage-based clustering, vertex proximity matrices, and graph representation learning. It evaluates 364 module combinations on synthetic and real datasets, finding that pipelines using Wasserman‑Faust, PPMI proximity, and DNGR representations match the performance of Leiden and Louvain while producing nested partitions. The approach excels on graphs with many small communities but is limited by its time complexity to networks of roughly 10,000 vertices on personal machines.