Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications, where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on the existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this article, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art GNNs into four categories, namely, recurrent GNNs, convolutional GNNs, graph autoencoders, and spatial-temporal GNNs. We further discuss the applications of GNNs across various domains and summarize the open-source codes, benchmark data sets, and model evaluation of GNNs. Finally, we propose potential research directions in this rapidly growing field.
https://tif.uad.ac.id/wp-content/uploads/logo-informatika.png00Program Studi Informatikahttps://tif.uad.ac.id/wp-content/uploads/logo-informatika.pngProgram Studi Informatika2023-01-05 15:40:012023-08-20 02:11:03A comprehensive survey on graph neural networks
Program Studi Informatika
Jalan Ahmad Yani (Ringroad Selatan) Tamanan, Banguntapan, Bantul, Yogyakarta 55166
Telepon : (0274) 563515, 511830, 379418, 371120
Faximille : 0274-564604
Email : prodi[at]tif.uad.ac.id