Everything is Connected: Graph Neural Networks

Petar Veličković
1/19/2023
cs.LGcs.AIcs.SI

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

In many ways, graphs are the main modality of data we receive from nature. This is due to the fact that most of the patterns we see, both in natural and artificial systems, are elegantly representable using the language of graph structures. Prominent examples include molecules (represented as graphs of atoms and bonds), social networks and transportation networks. This potential has already been seen by key scientific and industrial groups, with already-impacted application areas including traffic forecasting, drug discovery, social network analysis and recommender systems. Further, some of the most successful domains of application for machine learning in previous years -- images, text and speech processing -- can be seen as special cases of graph representation learning, and consequently there has been significant exchange of information between these areas. The main aim of this short survey is to enable the reader to assimilate the key concepts in the area, and position graph representation learning in a proper context with related fields.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{velikovi2023everything,
  title  = {Everything is Connected: Graph Neural Networks},
  author = {Petar Veličković},
  year   = {2023},
  eprint = {2301.08210},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.08210v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.08210.svg)](https://codeofpaper.com/paper/2301.08210)

Discussion