- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies the problem of federated graph clustering, focusing on the disagreement between local conflict screening and global semantic consensus. The authors first select reliable nodes to generate high-quality local summaries, which are then passed to the global consensus stage. Extensive experiments on multiple datasets with varying numbers of clients have demonstrated the effectiveness of the proposed framework. Despite these merits, several concerns still need to be clarified.
Critical strengths
1.The paper is well organized and clearly written.
2.The problem of federated graph clustering is interesting and meaningful.
3.The experiments are extensive and helpful to validate the effectiveness of the framework.
Critical weaknesses
1.In Eq. (11), the node features are fixed embeddings, and the normalized embedding in local cluster k depends on the cluster assignments. Additionally, the term \phi also appears to be fixed. Although the set of stable nodes varies according to the K-means clustering results, the paper employs discrete cluster assignments and node selection without providing a differentiable alternative mechanism. Consequently, based on the current formulation, it is unclear how this global semantic loss can directly optimize the local GNN encoders.
2.Several baselines do not incorporate the reasoning capabilities of LLMs. Therefore, it is necessary to distinguish the contribution of the proposed methodology from that of the LLMs.
3.One of the main motivations for federated graph clustering is privacy preservation, while the use of LLMs seems to require representative textual data. How does the proposed method properly address privacy concerns and computational efficiency? Additionally, an efficiency analysis of this method is required.
4.Evaluating the generalizability of the proposed method to larger-scale datasets and more clients would be valuable.
Questions for authors
Please answer the above weaknesses.