arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.02000cs.LG
收藏

图压缩综述

A Survey on Graph Condensation

Zhejiang University(浙江大学);Rensselaer Polytechnic Institute(伦斯勒理工学院)

Hongjia Xu, Liangliang Zhang, Yao Ma, Sheng Zhou, Zhuonan Zheng, Bu Jiajun

AI总结:

本文综述图压缩(GC)领域,定义其目标为在保留关键信息下缩减图规模,提出按目标的三类方法分类及按生成方式的两类公式分类,并分析数据集与评估指标,最后指出挑战与未来方向。

摘要:

大规模图上的分析对计算效率和资源需求构成了重大挑战。近年来,图压缩(Graph condensation, GC)作为一种解决方案应运而生,以应对图数据规模不断攀升所带来的挑战。图压缩的动机是在保留下游任务所需关键信息的同时,将大规模图缩减为较小规模。为了更好地理解图压缩并区分其与其他相关主题,我们给出了图压缩的正式定义,并建立了一个分类体系,根据其目标将现有方法系统性地分为三类,并将生成压缩图的公式化方法分为两类:修改原始图或合成全新的图。此外,我们的综述还包括对该领域数据集和评估指标的全面分析。最后,我们通过讨论挑战与局限性、概述未来方向以及提供简洁的指导方针来结束本文,以激发该领域未来的研究。

英文摘要:

Analytics on large-scale graphs have posed significant challenges to computational efficiency and resource requirements. Recently, Graph condensation (GC) has emerged as a solution to address challenges arising from the escalating volume of graph data. The motivation of GC is to reduce the scale of large graphs to smaller ones while preserving essential information for downstream tasks. For a better understanding of GC and to distinguish it from other related topics, we present a formal definition of GC and establish a taxonomy that systematically categorizes existing methods into three types based on its objective, and classify the formulations to generate the condensed graphs into two categories as modifying the original graphs or synthetic completely new ones. Moreover, our survey includes a comprehensive analysis of datasets and evaluation metrics in this field. Finally, we conclude by addressing challenges and limitations, outlining future directions, and offering concise guidelines to inspire future research in this field.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑