FedCND: Federated Graph-Level Clustering under Inter-Client Cluster Number Discrepancy
Junlong Wu, Renda Han, Wenxuan Tu, Jingxin Liu, Haotian Wang, Jieren Cheng
Abstract
Federated graph-level clustering (FGC) provides an effective solution for analyzing decentralized graph data with privacy protection. Existing methods typically assume that all clients have the same number of clusters. This assumption simplifies the learning task and has achieved preliminary success. However, this assumption rarely holds in practice, as clients often exhibit substantial heterogeneity in both data distributions and semantic granularity. As a result, cluster-specific knowledge becomes misaligned during server-side aggregation, which ultimately degrades the overall clustering performance. To address this challenge, we propose a novel Federated Graph Clustering under Inter-Client Cluster Number Discrepancy (FedCND) framework, which aligns inter-client heterogeneous distributions by decoupling graph data into public and private patterns. Specifically, after initial local training and clustering on each client, we design a public learner and a private learner to model public and private graph data, respectively. Only anonymized, cluster-level public information is uploaded to the server, while private information remains local. On the server, cluster-level public prototypes are aggregated based on affinities between reconstructed cluster-level graphs, enabling privacy-preserving prototype alignment across clients with heterogeneous cluster numbers and mitigating interference from misaligned information during global aggregation. Finally, private subgraphs derive client-specific prototypes through local relearning, which are subsequently fused with globally oriented public prototypes for better clustering. Extensive experiments demonstrate that the proposed FedCND achieves an average of 4.9% accuracy improvement against current state-of-the-art methods.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 8533493d-21eb-43ca-b1d2-e55fb2fe513fRelated papers
- Federated Graph-Level Clustering Network with Dual Knowledge SeparationXiaobao Wang, Renda Han, Ronghao Fu, Di JinICLR 2026
- Federated Graph-Level Clustering NetworkJingxin Liu, Jieren Cheng, Renda Han, Wenxuan Tu et al.AAAI 2025 · 9 citations
- Federated Node-Level Clustering Network with Cross-Subgraph Link MendingJingxin Liu, Renda Han, Wenxuan Tu, Haotian Wang et al.ICML 2025
- Asynchronous Federated Clustering with Unknown Number of ClustersYunfan Zhang, Yiqun Zhang, Yang Lu, Mengke Li et al.AAAI 2025 · 14 citations
- Towards Federated Clustering: A Client-wise Private Graph Aggregation FrameworkGuanxiong He, Zheng Wang, Jie Wang, Liaoyuan Tang et al.AAAI 2026
