解决跨机构图聚类数据孤岛问题,实现高效协作聚类。
Attributed Graph Clustering in Collaborative Settings
- 设计协同框架,支持多方持有不同特征的垂直分割图数据
- 在4个公开数据集上达到与集中式方法相当的聚类准确率
- 适用于隐私敏感场景,适合需要多方协作的图分析任务
图聚类是一种无监督机器学习方法,用于将图中节点划分为不同组。尽管在利用属性和结构信息方面取得显著进展,现有方法常面临数据隔离的实际挑战。此外,缺乏协同机制限制了其应用效果。本文提出一种面向属性图的协同图聚类框架,支持在多方持有相同数据不同特征的垂直分割数据上进行聚类。该方法采用新颖技术缩小样本空间,提升聚类效率。我们在邻近性条件下对比了该方法与集中式版本,证明各参与方本地结果的成功可共同促成整体协作成功。通过在四个公开数据集上的实验验证,所提方法在准确性上接近集中式方法,且具备高效性。该框架为应对数据隔离带来的图聚类挑战提供了有效解决方案。
原文摘要 · Abstract (English)
Graph clustering is an unsupervised machine learning method that partitions the nodes in a graph into different groups. Despite achieving significant progress in exploiting both attributed and structured data information, graph clustering methods often face practical challenges related to data isolation. Moreover, the absence of collaborative methods for graph clustering limits their effectiveness. In this paper, we propose a collaborative graph clustering framework for attributed graphs, supporting attributed graph clustering over vertically partitioned data with different participants holding distinct features of the same data. Our method leverages a novel technique that reduces the sample space, improving the efficiency of the attributed graph clustering method. Furthermore, we compare our method to its centralized counterpart under a proximity condition, demonstrating that the successful local results of each participant contribute to the overall success of the collaboration. We fully implement our approach and evaluate its utility and efficiency by conducting experiments on four public datasets. The results demonstrate that our method achieves comparable accuracy levels to centralized attributed graph clustering methods. Our collaborative graph clustering framework provides an efficient and effective solution for graph clustering challenges related to data isolation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。