paper-with-me

Papers

Text Enriched Sparse Hyperbolic Graph Convolutional Networks

2022-07-06 · Nurendra Choudhary, Nikhil Rao, Karthik Subbian, Chandan K. Reddy

Heterogeneous networks, which connect informative nodes containing text with different edge types, are routinely used to store and process information in various real-world applications. Graph Neural Networks (GNNs) and their hyperbolic variants provide a promising approach to encode such networks in a low-dimensional latent space through neighborhood aggregation and hierarchical feature extraction, respectively. However, these approaches typically ignore metapath structures and the available semantic information. Furthermore, these approaches are sensitive to the noise present in the training data. To tackle these limitations, in this paper, we propose Text Enriched Sparse Hyperbolic Graph Convolution Network (TESH-GCN) to capture the graph's metapath structures using semantic signals and further improve prediction in large heterogeneous graphs. In TESH-GCN, we extract semantic node information, which successively acts as a connection signal to extract relevant nodes' local neighborhood and graph-level metapath features from the sparse adjacency tensor in a reformulated hyperbolic graph convolution layer. These extracted features in conjunction with semantic features from the language model (for robustness) are used for the final downstream task. Experiments on various heterogeneous graph datasets show that our model outperforms the current state-of-the-art approaches by a large margin on the task of link prediction. We also report a reduction in both the training time and model parameters compared to the existing hyperbolic approaches through a reformulated hyperbolic graph convolution. Furthermore, we illustrate the robustness of our model by experimenting with different levels of simulated noise in both the graph structure and text, and also, present a mechanism to explain TESH-GCN's prediction by analyzing the extracted metapaths.

📄 PDF Abstract BibTeX arXiv:2207.02368

Code (0)

등록된 구현이 없습니다.

Tasks

Language ModellingLink Prediction

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

A Hyperbolic-to-Hyperbolic Graph Convolutional Network

2021-04-14 · CVPR 2021 1 · Jindou Dai, Yuwei Wu, Zhi Gao, Yunde Jia

Hyperbolic graph convolutional networks (GCNs) demonstrate powerful representation ability to model graphs with hierarchical structure. Existing hyperbolic GCNs resort to tangent spaces to realize graph convolution on hy…

General ClassificationGraph ClassificationLink PredictionNode Classification

Lorentzian Graph Convolutional Networks

2021-04-15 · Yiding Zhang, Xiao Wang, Chuan Shi, Nian Liu 외

Graph convolutional networks (GCNs) have received considerable research attention recently. Most GCNs learn the node representations in Euclidean geometry, but that could have a high distortion in the case of embedding g…

FFHR: Fully and Flexible Hyperbolic Representation for Knowledge Graph Completion

2023-02-07 · Wentao Shi, Junkang Wu, Xuezhi Cao, Jiawei Chen 외

Learning hyperbolic embeddings for knowledge graph (KG) has gained increasing attention due to its superiority in capturing hierarchies. However, some important operations in hyperbolic space still lack good definitions,…

Knowledge Graph CompletionRepresentation Learning

Hyperbolic Graph Convolutional Neural Networks

2019-10-28 · NeurIPS 2019 12 · Ines Chami, Rex Ying, Christopher Ré, Jure Leskovec

Graph convolutional neural networks (GCNs) embed nodes in a graph into Euclidean space, which has been shown to incur a large distortion when embedding real-world graphs with scale-free or hierarchical structure. Hyperbo…

Link PredictionNode Classification

DeepHGCN: Toward Deeper Hyperbolic Graph Convolutional Networks

2023-10-03 · Jiaxu Liu, Xinping Yi, Xiaowei Huang

Hyperbolic graph convolutional networks (HGCNs) have demonstrated significant potential in extracting information from hierarchical graphs. However, existing HGCNs are limited to shallow architectures due to the computat…

Computational EfficiencyLink PredictionNode Classification