A Survey of Data-Efficient Graph Learning

• URL: http://arxiv.org/abs/2402.00447v4
• Date: Wed, 19 Jun 2024 14:34:24 GMT
• Title: A Survey of Data-Efficient Graph Learning
• Authors: Wei Ju, Siyu Yi, Yifan Wang, Qingqing Long, Junyu Luo, Zhiping Xiao, Ming Zhang,
• Abstract summary: We introduce a novel concept of Data-Efficient Graph Learning (DEGL) as a research frontier. We systematically review recent advances on several key aspects, including self-supervised graph learning, semi-supervised graph learning, and few-shot graph learning.
• Score: 16.053913182723143
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph-structured data, prevalent in domains ranging from social networks to biochemical analysis, serve as the foundation for diverse real-world systems. While graph neural networks demonstrate proficiency in modeling this type of data, their success is often reliant on significant amounts of labeled data, posing a challenge in practical scenarios with limited annotation resources. To tackle this problem, tremendous efforts have been devoted to enhancing graph machine learning performance under low-resource settings by exploring various approaches to minimal supervision. In this paper, we introduce a novel concept of Data-Efficient Graph Learning (DEGL) as a research frontier, and present the first survey that summarizes the current progress of DEGL. We initiate by highlighting the challenges inherent in training models with large labeled data, paving the way for our exploration into DEGL. Next, we systematically review recent advances on this topic from several key aspects, including self-supervised graph learning, semi-supervised graph learning, and few-shot graph learning. Also, we state promising directions for future research, contributing to the evolution of graph machine learning.

Related papers

• Towards Graph Contrastive Learning: A Survey and Beyond [23.109430624817637]
  Self-supervised learning (SSL) on graphs has gained increasing attention and has made significant progress. SSL enables machine learning models to produce informative representations from unlabeled graph data. Graph Contrastive Learning (GCL) has not been thoroughly investigated in the existing literature.
  arXiv  Detail & Related papers  (2024-05-20T08:19:10Z)
• Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning [53.81365215811222]
  We provide a review and summary of the latest approaches, strategies, and insights that address distribution shifts within the context of graph learning. We categorize existing graph learning methods into several essential scenarios, including graph domain adaptation learning, graph out-of-distribution learning, and graph continual learning. We discuss the potential applications and future directions for graph learning under distribution shifts with a systematic analysis of the current state in this field.
  arXiv  Detail & Related papers  (2024-02-26T07:52:40Z)
• Towards Graph Foundation Models: A Survey and Beyond [66.37994863159861]
  Foundation models have emerged as critical components in a variety of artificial intelligence applications. The capabilities of foundation models to generalize and adapt motivate graph machine learning researchers to discuss the potential of developing a new graph learning paradigm. This article introduces the concept of Graph Foundation Models (GFMs), and offers an exhaustive explanation of their key characteristics and underlying technologies.
  arXiv  Detail & Related papers  (2023-10-18T09:31:21Z)
• 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)
• A Comprehensive Survey on Deep Graph Representation Learning [26.24869157855632]
  Graph representation learning aims to encode high-dimensional sparse graph-structured data into low-dimensional dense vectors. Traditional methods have limited model capacity which limits the learning performance. Deep graph representation learning has shown great potential and advantages over shallow (traditional) methods.
  arXiv  Detail & Related papers  (2023-04-11T08:23:52Z)
• Counterfactual Learning on Graphs: A Survey [34.47646823407408]
  Graph neural networks (GNNs) have achieved great success in representation learning on graphs. Counterfactual learning on graphs has shown promising results in alleviating these drawbacks. Various approaches have been proposed for counterfactual fairness, explainability, link prediction and other applications on graphs.
  arXiv  Detail & Related papers  (2023-04-03T21:42:42Z)
• 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)
• Curriculum Graph Machine Learning: A Survey [51.89783017927647]
  curriculum graph machine learning (Graph CL) integrates the strength of graph machine learning and curriculum learning. This paper comprehensively overview approaches on Graph CL and present a detailed survey of recent advances in this direction.
  arXiv  Detail & Related papers  (2023-02-06T16:59:25Z)
• 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)

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.