State of the Art and Potentialities of Graph-level Learning

Author:

Yang Zhenyu1ORCID,Zhang Ge21ORCID,Wu Jia1ORCID,Yang Jian1ORCID,Sheng Quan Z.3ORCID,Xue Shan1ORCID,Zhou Chuan4ORCID,Aggarwal Charu5ORCID,Peng Hao6ORCID,Hu Wenbin7ORCID,Hancock Edwin8ORCID,Liò Pietro9ORCID

Affiliation:

1. School of Computing, Macquarie University, Sydney, Australia

2. School of Computing, Donghua University, Shanghai, China

3. School of Computing, Macquarie University, Sydney Australia

4. Chinese Academy of Sciences, Beijing, China

5. Office 4S-A20, IBM T. J. Watson Research Center, Hawthorne, United States

6. Beihang University, Beijing China

7. Wuhan University, Wuhan, China

8. University of York, York United Kingdom of Great Britain and Northern Ireland

9. University of Cambridge, Cambridge United Kingdom of Great Britain and Northern Ireland

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Reference310 articles.

1. Leonhard Euler. 1741. Solutio problematis ad geometriam situs pertinentis. Comment. Acad. Sci. Imp. Petropol.(1741) 128–140.

2. MoleculeNet: a benchmark for molecular machine learning

3. Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How Powerful are Graph Neural Networks?. In Proc. ICLR. 1–17.

4. Muhan Zhang, Zhicheng Cui, Marion Neumann, and Yixin Chen. 2018. An end-to-end deep learning architecture for graph classification. In Proc. AAAI. 1–8.

5. Haggai Maron, Heli Ben-Hamu, Hadar Serviansky, and Yaron Lipman. 2019. Provably powerful graph networks. In Proc. NeurIPS. 1–12.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3