arXiv:2412.17961cs.LG2024-12中稿 · Transactions on Ma…被引 1

提出多标签图压缩方法,提升大图神经网络训练效率。

Extending Graph Condensation to Multi-Label Datasets: A Benchmark Study

  • 改进初始化与优化策略,适配多标签图数据
  • 在8个真实数据集上验证,性能优于现有方法
  • 适合社交网络、生物信息等多标签场景

随着图数据日益复杂,基于大规模图数据训练图神经网络(GNN)面临计算资源受限、数据冗余和传输效率低等问题。现有图压缩技术主要针对单标签数据集设计,而现实应用如社交网络分析与生物信息学常涉及多标签图数据,即一个节点可关联多个相关标签。为此,本文将传统图压缩方法拓展至多标签场景,通过改进合成数据集初始化方式与压缩优化策略实现。在八个真实多标签图数据集上的实验表明,结合K-Center初始化与二元交叉熵损失(BCELoss)的GCond框架表现最佳。该基准研究不仅提升了多标签图数据上GNN的可扩展性与训练效率,也为多种实际应用场景带来显著收益。

原文摘要 · Abstract (English)

As graph data grows increasingly complicate, training graph neural networks (GNNs) on large-scale datasets presents significant challenges, including computational resource constraints, data redundancy, and transmission inefficiencies. While existing graph condensation techniques have shown promise in addressing these issues, they are predominantly designed for single-label datasets, where each node is associated with a single class label. However, many real-world applications, such as social network analysis and bioinformatics, involve multi-label graph datasets, where one node can have various related labels. To deal with this problem, we extends traditional graph condensation approaches to accommodate multi-label datasets by introducing modifications to synthetic dataset initialization and condensing optimization. Through experiments on eight real-world multi-label graph datasets, we prove the effectiveness of our method. In experiment, the GCond framework, combined with K-Center initialization and binary cross-entropy loss (BCELoss), achieves best performance in general. This benchmark for multi-label graph condensation not only enhances the scalability and efficiency of GNNs for multi-label graph data, but also offering substantial benefits for diverse real-world applications.

图神经网络图压缩多标签学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。