Abstract

The last half-decade has seen a surge in deep learning research on irregular domains and efforts to extend convolutional neural networks (CNNs) to work on irregularly structured data. The graph has emerged as a particularly useful geometrical object in deep learning, able to represent a variety of irregular domains well. Graphs can represent various complex systems, from molecular structure, to computer and social and traffic networks. Consequent on the extension of CNNs to graphs, a great amount of research has been published that improves the inferential power and computational efficiency of graph-based convolutional neural networks (GCNNs). The research is incipient, however, and our understanding is relatively rudimentary. The majority of GCNNs are designed to operate with certain properties. In this survey we review of the state of graph representation learning from the perspective of deep learning. We consider challenges in graph deep learning that have been neglected in the majority of work, largely because of the numerous theoretical difficulties they present. We identify four major challenges in graph deep learning: dynamic and evolving graphs, learning with edge signals and information, graph estimation, and the generalization of graph models. For each problem we discuss the theoretical and practical issues, survey the relevant research, while highlighting the limitations of the state of the art. Advances on these challenges would permit GCNNs to be applied to wider range of domains, in situations where graph models have previously been limited owing to the obstructions to applying a model owing to the domains’ natures.

Highlights

  • CNNs are powerful models, but their conventional formulation is limited to regularly structured information

  • The three primary challenges we identify are temporal graphs, edge attributes and signals on graphs and graph estimation, which we complement with a VOLUME 9, 2021 discussion on a group of problems that are theoretical and practical obstacles in graph model generalization

  • The convolutional neural networks (CNNs) is demonstrably effective in identifying patterns

Read more

Summary

INTRODUCTION

But their conventional formulation is limited to regularly structured information. Others specialize in narrower domains and specific applications such as vertex embedding [35], [36], knowledge graph embedding [37] or on specific model architectures such as attention models [38] By contrast, in this survey we identify several fundamental theoretical and practical challenges to learning on graphs that, to the best of our knowledge, have not yet been the primary objects of discussion in any survey to date. Graphs are not represented neatly as single entities like images: often information is missing, resulting in a graph with incomplete connectivity or missing signals We consider this a sub-problem of generalization, and discuss the matter from its different perspectives.

BACKGROUND
GENERAL GRAPH FRAMEWORKS
SPECTRAL CONVOLUTION ON GRAPHS
EDGE ATTRIBUTES AND SIGNALS
GRAPH ESTIMATION
Findings
VIII. CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call