2020arXiv (Cornell University)Open access

Geometric Graph Representations and Geometric Graph Convolutions for\n Deep Learning on Three-Dimensional (3D) Graphs

Daniel T. Chang

Open full text 1 citations

Abstract

The geometry of three-dimensional (3D) graphs, consisting of nodes and edges,\nplays a crucial role in many important applications. An excellent example is\nmolecular graphs, whose geometry influences important properties of a molecule\nincluding its reactivity and biological activity. To facilitate the\nincorporation of geometry in deep learning on 3D graphs, we define three types\nof geometric graph representations: positional, angle-geometric and\ndistance-geometric. For proof of concept, we use the distance-geometric graph\nrepresentation for geometric graph convolutions. Further, to utilize standard\ngraph convolution networks, we employ a simple edge weight / edge distance\ncorrelation scheme, whose parameters can be fixed using reference values or\ndetermined through Bayesian hyperparameter optimization. The results of\ngeometric graph convolutions, for the ESOL and Freesol datasets, show\nsignificant improvement over those of standard graph convolutions. Our work\ndemonstrates the feasibility and promise of incorporating geometry, using the\ndistance-geometric graph representation, in deep learning on 3D graphs.\n

Open-access reader

About this research paper

What this paper is about

The geometry of three-dimensional (3D) graphs, consisting of nodes and edges,\nplays a crucial role in many important applications. An excellent example is\nmolecular graphs, whose geometry influences important properties of a molecule\nincluding its reactivity and biological activity. To facilitate the\nincorporation of geometry in deep learning on 3D graphs, we define three types\nof geometric graph representations: positional, angle-geometric and\ndistance-geometric. For proof of concept, we use the distance-geometric graph\nrepresentation for geometric graph convolutions. Further, to utilize standard\ngraph convolution networks, we employ a simple edge weight / edge distance\ncorrelation scheme, whose parameters can be fixed using reference values or\ndetermined through Bayesian hyperparameter optimization. The results of\ngeometric graph convolutions, for the ESOL and Freesol datasets, show\nsignificant improvement over those of standard graph convolutions. Our work\ndemonstrates the feasibility and promise of incorporating geometry, using the\ndistance-geometric graph representation, in deep learning on 3D graphs.\n

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The geometry of three-dimensional (3D) graphs, consisting of nodes and edges,\nplays a crucial role in many important applications. An excellent example is\nmolecular graphs, whose geometry influences important properties of a molecule\nincluding its reactivity and biological activity. To facilitate the\nincorporation of geometry in deep learning on 3D graphs, we define three types\nof geometric graph representations: positional, angle-geometric and\ndistance-geometric. For proof of concept, we use the distance-geometric graph\nrepresentation for geometric graph convolutions. Further, to utilize standard\ngraph convolution networks, we employ a simple edge weight / edge distance\ncorrelation scheme, whose parameters can be fixed using reference values or\ndetermined through Bayesian hyperparameter optimization. The results of\ngeometric graph convolutions, for the ESOL and Freesol datasets, show\nsignificant improvement over those of standard graph convolutions. Our work\ndemonstrates the feasibility and promise of incorporating geometry, using the\ndistance-geometric graph representation, in deep learning on 3D graphs.\n

Key concepts: Geometric graph theory, Random geometric graph, Geometric networks, Line graph, Spatial network, Graph, Voltage graph, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Geometric Graph Representations and Geometric Graph Convolutions for\n Deep Learning on Three-Dimensional (3D) Graphs — Research Paper | ScholarLens