Saved in:
Bibliographic Details
Main Authors: Jiang, Bo, Ge, Sheng, Zhang, Ziyan, Wang, Beibei, Tang, Jin, Luo, Bin
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2406.14846
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929393714069504
author Jiang, Bo
Ge, Sheng
Zhang, Ziyan
Wang, Beibei
Tang, Jin
Luo, Bin
author_facet Jiang, Bo
Ge, Sheng
Zhang, Ziyan
Wang, Beibei
Tang, Jin
Luo, Bin
contents Graph Convolutional Networks (GCNs) have been widely studied. The core of GCNs is the definition of convolution operators on graphs. However, existing Graph Convolution (GC) operators are mainly defined on adjacency matrix and node features and generally focus on obtaining effective node embeddings which cannot be utilized to address the graphs with (high-dimensional) edge features. To address this problem, by leveraging tensor contraction representation and tensor product graph diffusion theories, this paper analogously defines an effective convolution operator on graphs with edge features which is named as Tensor Product Graph Convolution (TPGC). The proposed TPGC aims to obtain effective edge embeddings. It provides a complementary model to traditional graph convolutions (GCs) to address the more general graph data analysis with both node and edge features. Experimental results on several graph learning tasks demonstrate the effectiveness of the proposed TPGC.
format Preprint
id arxiv_https___arxiv_org_abs_2406_14846
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Graph Edge Representation via Tensor Product Graph Convolutional Representation
Jiang, Bo
Ge, Sheng
Zhang, Ziyan
Wang, Beibei
Tang, Jin
Luo, Bin
Machine Learning
Graph Convolutional Networks (GCNs) have been widely studied. The core of GCNs is the definition of convolution operators on graphs. However, existing Graph Convolution (GC) operators are mainly defined on adjacency matrix and node features and generally focus on obtaining effective node embeddings which cannot be utilized to address the graphs with (high-dimensional) edge features. To address this problem, by leveraging tensor contraction representation and tensor product graph diffusion theories, this paper analogously defines an effective convolution operator on graphs with edge features which is named as Tensor Product Graph Convolution (TPGC). The proposed TPGC aims to obtain effective edge embeddings. It provides a complementary model to traditional graph convolutions (GCs) to address the more general graph data analysis with both node and edge features. Experimental results on several graph learning tasks demonstrate the effectiveness of the proposed TPGC.
title Graph Edge Representation via Tensor Product Graph Convolutional Representation
topic Machine Learning
url https://arxiv.org/abs/2406.14846