4.7 Article

A systematic analysis and guidelines of graph neural networks for practical applications

期刊

EXPERT SYSTEMS WITH APPLICATIONS
卷 184, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2021.115466

关键词

Graph neural network; Graph embedding; Deep learning; Graph classification; Social network analysis; Bioinformatics

资金

  1. IITP grant - Korean government (MSIT) [2020-0-01361]
  2. Electronics and Telecommunications Research Institute (ETRI) grant - Korean government [21ZS1100]
  3. Institute for Information & Communication Technology Planning & Evaluation (IITP), Republic of Korea [21ZS1100] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

向作者/读者索取更多资源

An anatomical comparison of GNNs provides insight into devising better solutions. By systematically analyzing and comparing thousands of runs, researchers deduced five guidelines for an appropriate model. The study aims to guide the use of GNN for graph classification and validation of experimental reproducibility and replicability.
A graph neural network (GNN) draws attention to deal with many problems in social networks and bioinformatics, as graph data proliferate in a wide variety of applications. Despite the large amount of investigation, it is still difficult to choose the most suitable method for a given problem due to the lack of a thorough analysis on the feasible methods. An anatomical comparison of GNNs would help to devise a prospective method for better solution to real-world problems. In order to give guidelines to make full use of the GNN for graph classification, this paper attempts to analyze the state-of-the-art methods of the GNN and provide practicable guidelines for applications. The representative methods are described with a systematic scheme in four phases for GNN: 1) preprocessing, 2) aggregation, 3) readout, and 4) classification with graph embedding, resulting in a large coverage of more than 1300 methods. The 13 well-known benchmark datasets are categorized into three types with respect to the properties of graph data such as connectivity. In total, more than 3600 runs are executed to systematically analyze and compare the GNN models while changing only one method for each phase. Experimental reproducibility and replicability are also verified by comparing the results with the performance from the literature. Finally, five guidelines for an appropriate model are deduced according to the graph characteristics such as complexity on connectivity and node feature.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据