Edge Representation Learning with Hypergraphs

Abstract

Graph neural networks have recently achieved remarkable success in representing graph-structured data, with rapid progress in both the node embedding and graph pooling methods. Yet, they mostly focus on capturing information from the nodes considering their connectivity, and not much work has been done in representing the edges, which are essential components of a graph. However, for tasks such as graph reconstruction and generation, as well as graph classification tasks for which the edges are important for discrimination, accurately representing edges of a given graph is crucial to the success of the graph representation learning. To this end, we propose a novel edge representation learning framework based on Dual Hypergraph Transformation (DHT), which transforms the edges of a graph into the nodes of a hypergraph. This dual hypergraph construction allows us to apply message-passing techniques for node representations to edges. After obtaining edge representations from the hypergraphs, we then cluster or drop edges to obtain holistic graph-level edge representations. We validate our edge representation learning method with hypergraphs on diverse graph datasets for graph representation and generation performance, on which our method largely outperforms existing graph representation learning methods. Moreover, our edge representation learning and pooling method also largely outperforms state-of-the-art graph pooling methods on graph classification, not only because of its accurate edge representation learning, but also due to its lossless compression of the nodes and removal of irrelevant edges for effective message-passing.

arXiv commentNeurIPS 2021

References in corpus (20)

• Adam: A Method for Stochastic Optimization
• Emergence of scaling in random networks
• Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
• PyTorch: An Imperative Style, High-Performance Deep Learning Library
• Inductive Representation Learning on Large Graphs
• Neural Message Passing for Quantum Chemistry
• Graph Neural Networks: A Review of Methods and Applications
• Fast Graph Representation Learning with PyTorch Geometric
• DropEdge: Towards Deep Graph Convolutional Networks on Node Classification
• MolGAN: An implicit generative model for small molecular graphs
• Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning
• TUDataset: A collection of benchmark datasets for learning with graphs
• Benchmarking Graph Neural Networks
• Strategies for Pre-training Graph Neural Networks
• A Fair Comparison of Graph Neural Networks for Graph Classification
• Edge Contraction Pooling for Graph Neural Networks
• Accurate Learning of Graph Representations with Graph Multiset Pooling
• Molecular Hypergraph Grammar with its Application to Molecular Optimization
• Dual-Primal Graph Convolutional Networks
• MARS: Markov Molecular Sampling for Multi-objective Drug Discovery