A Survey on Graph Condensation
- URL: http://arxiv.org/abs/2402.02000v1
- Date: Sat, 3 Feb 2024 02:50:51 GMT
- Title: A Survey on Graph Condensation
- Authors: Hongjia Xu, Liangliang Zhang, Yao Ma, Sheng Zhou, Zhuonan Zheng, Bu
Jiajun
- Abstract summary: Graph condensation (GC) has emerged as a solution to address challenges arising from the escalating volume of graph data.
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.
We conclude by addressing challenges and limitations, outlining future directions, and offering concise guidelines to inspire future research in this field.
- Score: 14.94630644865636
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation [21.76051896779245]
We aim to provide a comprehensive understanding of graph reduction methods, including graph sparsification, graph coarsening, and graph condensation.
Our survey then systematically reviews the technical details of these methods and emphasizes their practical applications across diverse scenarios.
arXiv Detail & Related papers (2024-01-29T01:19:09Z) - Graph Condensation: A Survey [49.41718583061147]
The rapid growth of graph data poses significant challenges in storage, transmission, and particularly the training of graph neural networks (GNNs)
To address these challenges, graph condensation (GC) has emerged as an innovative solution.
GC focuses on a compact yet highly representative graph, enabling GNNs trained on it to achieve performance comparable to those trained on the original large graph.
arXiv Detail & Related papers (2024-01-22T06:47:00Z) - Towards Data-centric Graph Machine Learning: Review and Outlook [120.64417630324378]
We introduce a systematic framework, Data-centric Graph Machine Learning (DC-GML), that encompasses all stages of the graph data lifecycle.
A thorough taxonomy of each stage is presented to answer three critical graph-centric questions.
We pinpoint the future prospects of the DC-GML domain, providing insights to navigate its advancements and applications.
arXiv Detail & Related papers (2023-09-20T00:40:13Z) - Structure-free Graph Condensation: From Large-scale Graphs to Condensed
Graph-free Data [91.27527985415007]
Existing graph condensation methods rely on the joint optimization of nodes and structures in the condensed graph.
We advocate a new Structure-Free Graph Condensation paradigm, named SFGC, to distill a large-scale graph into a small-scale graph node set.
arXiv Detail & Related papers (2023-06-05T07:53:52Z) - A Comprehensive Survey on Graph Summarization with Graph Neural Networks [21.337505372979066]
In the past, most graph summarization techniques sought to capture the most important part of a graph statistically.
Today, the high dimensionality and complexity of modern graph data are making deep learning techniques more popular.
Our investigation includes a review of the current state-of-the-art approaches, including recurrent GNNs, convolutional GNNs, graph autoencoders, and graph attention networks.
arXiv Detail & Related papers (2023-02-13T05:43:24Z) - Knowledge Distillation on Graphs: A Survey [43.60992916277081]
knowledge distillation on graphs (KDG) has been introduced to build a smaller yet effective model and exploit more knowledge from data.
We introduce KDG challenges and bases, then categorize and summarize existing works of KDG.
arXiv Detail & Related papers (2023-02-01T03:51:05Z) - Graph Pooling for Graph Neural Networks: Progress, Challenges, and
Opportunities [128.55790219377315]
Graph neural networks have emerged as a leading architecture for many graph-level tasks.
graph pooling is indispensable for obtaining a holistic graph-level representation of the whole graph.
arXiv Detail & Related papers (2022-04-15T04:02:06Z) - Data Augmentation for Deep Graph Learning: A Survey [66.04015540536027]
We first propose a taxonomy for graph data augmentation and then provide a structured review by categorizing the related work based on the augmented information modalities.
Focusing on the two challenging problems in DGL (i.e., optimal graph learning and low-resource graph learning), we also discuss and review the existing learning paradigms which are based on graph data augmentation.
arXiv Detail & Related papers (2022-02-16T18:30:33Z) - A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
We propose a robust framework for adversarial graph embedding, named AGE.
AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution.
Based on this framework, we propose three models to handle three types of graph data.
arXiv Detail & Related papers (2021-05-22T07:05:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.