From 395476d253c0cbc51cba818672c964eef0abadb4 Mon Sep 17 00:00:00 2001
From: zhenyuyang <391577252@qq.com>
Date: Fri, 13 Sep 2024 15:50:47 +1000
Subject: [PATCH] Update 2024-09-13-survey.md

---
 _posts/2024-09-13-survey.md | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/_posts/2024-09-13-survey.md b/_posts/2024-09-13-survey.md
index a6dd5c3..063f0dd 100644
--- a/_posts/2024-09-13-survey.md
+++ b/_posts/2024-09-13-survey.md
@@ -1,10 +1,9 @@
 ---
-title: A Comprehensive Survey of Graph-level Learning
+title: State of the Art and Potentialities of Graph-level Learning
 categories: [Publications]
 comments: true
 authors: Zhenyu Yang*, Ge Zhang, Jia Wu, Jian Yang, Quan Z. Sheng, Shan Xue, Chuan Zhou, Charu Aggarwal, Hao Peng, Wenbin Hu, Edwin Hancock, Pietro Li`o 
 link: https://dl.acm.org/doi/pdf/10.1145/3695863
 venues: Acm Computing Survey (Impact Factor: 23.8)
 ---
-
-Graphs have a superior ability to represent relational data, like chemical compounds, proteins, and social networks. Hence, graph-level learning, which takes a set of graphs as input, has been applied to many tasks including comparison, regression, classification, and more. Traditional approaches to learning a set of graphs tend to rely on hand-crafted features, such as substructures. But while these methods benefit from good interpretability, they often suffer from computational bottlenecks as they cannot skirt the graph isomorphism problem. Conversely, deep learning has helped graph-level learning adapt to the growing scale of graphs by extracting features automatically and decoding graphs into low-dimensional representations. As a result, these deep graph learning methods have been responsible for many successes. Yet, there is no comprehensive survey that reviews graph-level learning starting with traditional learning and moving through to the deep learning approaches. This article fills this gap and frames the representative algorithms into a systematic taxonomy covering traditional learning, graph-level deep neural networks, graph-level graph neural networks, and graph pooling. To ensure a thoroughly comprehensive survey, the evolutions, interactions, and communications between methods from four different branches of development are also examined. This is followed by a brief review of the benchmark data sets, evaluation metrics, and common downstream applications. The survey concludes with 13 future directions of necessary research that will help to overcome the challenges facing this booming field.
\ No newline at end of file
+Graphs have a superior ability to represent relational data, like chemical compounds, proteins, and social networks. Hence, graph-level learning, which takes a set of graphs as input, has been applied to many tasks including comparison, regression, classification, and more. Traditional approaches to learning a set of graphs heavily rely on hand-crafted features, such as substructures. While these methods benefit from good interpretability, they often suffer from computational bottlenecks as they cannot skirt the graph isomorphism problem. Conversely, deep learning has helped graph-level learning adapt to the growing scale of graphs by extracting features automatically and encoding graphs into low-dimensional representations. As a result, these deep graph learning methods have been responsible for many successes. Yet, no comprehensive survey reviews graph-level learning starting with traditional learning and moving through to the deep learning approaches. This article fills this gap and frames the representative algorithms into a systematic taxonomy covering traditional learning, graph-level deep neural networks, graph-level graph neural networks, and graph pooling. In addition, the evolution and interaction between methods from these four branches within their developments are examined to provide an in-depth analysis. This is followed by a brief review of the benchmark datasets, evaluation metrics, and common downstream applications. Finally, the survey concludes with an in-depth discussion of 12 current and future directions in this booming field.
\ No newline at end of file