Causally-Aware Attribute Completion for Incomplete Federated Graph Clustering
Jingxin Liu, Wenxuan Tu, Haotian Wang, Renda Han, Haoyi Li, Junlong Wu, Xiangyan Tang
Abstract
Node-level federated graph clustering allows multiple unlabeled subgraph holders to collaboratively train on node-level tasks without sharing private information. Existing methods usually assume that the node attributes are complete and have achieved promising progress. However, in the Federated Graph Learning (FGL) scenarios, this assumption is overly strict due to failures in data collection devices. Consequently, most existing FGL frameworks struggle to extract useful features from attribute-incomplete graphs for clustering, yet the issue remains underexplored. To bridge this gap, we propose a causally-aware attribute completion for Incomplete Federated Graph Clustering (IFedGC), which constructs a reliable global causal structure that incorporates clustering-friendly information to guide attribute completion for each subgraph. Specifically, in the attribute completion step, we first construct the causal structure to extract the causal relationships between initialized features, and then upload them to the server. Subsequently, we integrate multiple uploaded causal structures into a global causal one to achieve cross-client attribute completion. Moreover, to support reliable clustering, we first collect the high-confidence cluster centroids from each subgraph using a Graph Neural Network (GNN) model and subsequently aggregate these centroids on the server. The above two steps are seamlessly integrated into a unified FGL framework to obtain a clustering-oriented causal structure, which is sent back to the client to promote high-quality attribute completion for better clustering. Extensive results on five benchmark datasets demonstrate the effectiveness and superiority of IFedGC against its competitors.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 21339796-e535-4fe9-b639-58a64f28e4c4Builds on19
- Deep Graph Clustering via Dual Correlation ReductionYue Liu, Wenxuan Tu, Sihang Zhou, Xinwang Liu et al.AAAI 2022 · 300 citations
- Hard Sample Aware Network for Contrastive Deep Graph ClusteringYue Liu, Xihong Yang, Sihang Zhou, Xinwang Liu et al.AAAI 2023 · 175 citations
- Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching CorrespondencesSiwei Wang, Xinwang Liu, Suyuan Liu, Jiaqi Jin et al.NeurIPS 2022 · 144 citations
- Highly-efficient Incomplete Largescale Multiview Clustering with Consensus Bipartite GraphSiwei Wang, Xinwang Liu, Li Liu, Wenxuan Tu et al.CVPR 2022 · 134 citations
- Efficient Deep Embedded Subspace ClusteringJinyu Cai, Jicong Fan, Wenzhong Guo, Shiping Wang et al.CVPR 2022 · 127 citations
Related papers
- Federated Node-Level Clustering Network with Cross-Subgraph Link MendingJingxin Liu, Renda Han, Wenxuan Tu, Haotian Wang et al.ICML 2025
- Federated Graph-Level Clustering NetworkJingxin Liu, Jieren Cheng, Renda Han, Wenxuan Tu et al.AAAI 2025 · 9 citations
- Less is More: Federated Graph Learning with Alleviating Topology Heterogeneity from A Causal PerspectiveLele Fu, Bowen Deng, Sheng Huang, Tianchi Liao et al.ICML 2025
- Federated Graph-level Clustering Network with Attribute InferenceRenda Han, Junlong Wu, Wenxuan Tu, Jingxin Liu et al.AAAI 2026 · 1 citation
- Federated Incomplete Multi-view Clustering with Globally Fused Graph GuidanceGuoqing Chao, Zhenghao Zhang, Lei Meng, Jie Wen et al.ICML 2025
