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

• URL: http://arxiv.org/abs/2006.01785v1
• Date: Tue, 2 Jun 2020 17:08:59 GMT
• Title: Geometric Graph Representations and Geometric Graph Convolutions for Deep Learning on Three-Dimensional (3D) Graphs
• Authors: Daniel T. Chang
• Abstract summary: The geometry of three-dimensional (3D) graphs, consisting of nodes and edges, plays a crucial role in many important applications. We define three types of geometric graph representations: positional, angle-geometric and distance-geometric. For proof of concept, we use the distance-geometric graph representation for geometric graph convolutions. The results of geometric graph convolutions, for the ESOL and Freesol datasets, show significant improvement over those of standard graph convolutions.
• Score: 0.8722210937404288
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The geometry of three-dimensional (3D) graphs, consisting of nodes and edges, plays a crucial role in many important applications. An excellent example is molecular graphs, whose geometry influences important properties of a molecule including its reactivity and biological activity. To facilitate the incorporation of geometry in deep learning on 3D graphs, we define three types of geometric graph representations: positional, angle-geometric and distance-geometric. For proof of concept, we use the distance-geometric graph representation for geometric graph convolutions. Further, to utilize standard graph convolution networks, we employ a simple edge weight / edge distance correlation scheme, whose parameters can be fixed using reference values or determined through Bayesian hyperparameter optimization. The results of geometric graph convolutions, for the ESOL and Freesol datasets, show significant improvement over those of standard graph convolutions. Our work demonstrates the feasibility and promise of incorporating geometry, using the distance-geometric graph representation, in deep learning on 3D graphs.

Related papers

• A Survey of Geometric Graph Neural Networks: Data Structures, Models and Applications [67.33002207179923]
  This paper presents a survey of data structures, models, and applications related to geometric GNNs. We provide a unified view of existing models from the geometric message passing perspective. We also summarize the applications as well as the related datasets to facilitate later research for methodology development and experimental evaluation.
  arXiv  Detail & Related papers  (2024-03-01T12:13:04Z)
• A Hitchhiker's Guide to Geometric GNNs for 3D Atomic Systems [87.30652640973317]
  Recent advances in computational modelling of atomic systems represent them as geometric graphs with atoms embedded as nodes in 3D Euclidean space. Geometric Graph Neural Networks have emerged as the preferred machine learning architecture powering applications ranging from protein structure prediction to molecular simulations and material generation. This paper provides a comprehensive and self-contained overview of the field of Geometric GNNs for 3D atomic systems.
  arXiv  Detail & Related papers  (2023-12-12T18:44:19Z)
• Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data [91.27527985415007]
  Existing graph condensation methods rely on the joint optimization of nodes and structures in the condensed graph. We advocate a new Structure-Free Graph Condensation paradigm, named SFGC, to distill a large-scale graph into a small-scale graph node set.
  arXiv  Detail & Related papers  (2023-06-05T07:53:52Z)
• 3D Molecular Geometry Analysis with 2D Graphs [79.47097907673877]
  Ground-state 3D geometries of molecules are essential for many molecular analysis tasks. Modern quantum mechanical methods can compute accurate 3D geometries but are computationally prohibitive. We propose a novel deep learning framework to predict 3D geometries from molecular graphs.
  arXiv  Detail & Related papers  (2023-05-01T19:00:46Z)
• Distance Measures for Geometric Graphs [0.0]
  We study two notions of distance measures for geometric graphs, called the geometric edit distance (GED) and geometric graph distance (GGD) GED is based on the idea of editing one graph to transform it into the other graph, while GGD is inspired by inexact matching of the graphs. We show that GGD is $mathcalNP$-hard to compute, even if the distance is $mathcalNP$-hard to compute.
  arXiv  Detail & Related papers  (2022-09-26T17:35:29Z)
• Shortest Paths in Graphs with Matrix-Valued Edges: Concepts, Algorithm and Application to 3D Multi-Shape Analysis [69.08838724594584]
  Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics. We introduce the novel graph-theoretic concept of a shortest path in a graph with matrix-valued edges.
  arXiv  Detail & Related papers  (2021-12-08T08:23:37Z)
• Joint 3D Human Shape Recovery from A Single Imag with Bilayer-Graph [35.375489948345404]
  We propose a dual-scale graph approach to estimate the 3D human shape and pose from images. We use a coarse graph, derived from a dense graph, to estimate the human's 3D pose, and the dense graph to estimate the 3D shape. We train our model end-to-end and show that we can achieve state-of-the-art results for several evaluation datasets.
  arXiv  Detail & Related papers  (2021-10-16T05:04:02Z)
• Pre-training Molecular Graph Representation with 3D Geometry [39.35244035710228]
  Molecular graphs are typically modeled by their 2D topological structures. Lack of 3D information in real-world scenarios has significantly impeded the learning of geometric graph representation. We propose the Graph Multi-View Pre-training (GraphMVP) framework where self-supervised learning is performed by leveraging the correspondence and consistency between 2D topological structures and 3D geometric views.
  arXiv  Detail & Related papers  (2021-10-07T17:48:57Z)
• Joint Deep Multi-Graph Matching and 3D Geometry Learning from Inhomogeneous 2D Image Collections [57.60094385551773]
  We propose a trainable framework for learning a deformable 3D geometry model from inhomogeneous image collections. We in addition obtain the underlying 3D geometry of the objects depicted in the 2D images.
  arXiv  Detail & Related papers  (2021-03-31T17:25:36Z)
• Graph Geometry Interaction Learning [41.10468385822182]
  We develop a novel Geometry Interaction Learning (GIL) method for graphs, a well-suited and efficient alternative for learning abundant geometric properties in graph. Our method endows each node the freedom to determine the importance of each geometry space via a flexible dual feature interaction learning and probability assembling mechanism. Promising experimental results are presented for five benchmark datasets on node classification and link prediction tasks.
  arXiv  Detail & Related papers  (2020-10-23T02:40:28Z)
• Distance-Geometric Graph Convolutional Network (DG-GCN) for Three-Dimensional (3D) Graphs [0.8722210937404288]
  We propose a message-passing graph convolutional network based on the distance-geometric graph representation: DG-GCN. It enables learning of filter weights from distances, thereby incorporating the geometry of 3D graphs in graph convolutions. Our work demonstrates the utility and value of DG-GCN for end-to-end deep learning on 3D graphs, particularly molecular graphs.
  arXiv  Detail & Related papers  (2020-07-06T15:20:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.