4.7 Article

ROLE: Rotated Lorentzian Graph Embedding Model for Asymmetric Proximity

Journal

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume 35, Issue 9, Pages 9140-9153

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2022.3221929

Keywords

Directed graphs; Task analysis; Deep learning; Computational modeling; Social networking (online); Learning systems; Training; Squared lorentzian distance; rotation; graph embedding; node proximity

Ask authors/readers for more resources

Graph embedding aims to learn low-dimensional node representations to preserve original graph structures. Most existing graph embedding models fail to effectively preserve complex patterns, such as hierarchical structures, in Euclidean spaces. To address this, we propose a novel Rotated Lorentzian Embedding (ROLE) model that can capture hierarchical structures and model asymmetric proximity using rotation transformations. Experimental results on real-world directed graph datasets demonstrate that ROLE consistently outperforms various state-of-the-art embedding models, especially in the task of node recommendation.
Graph embedding, which aims to learn low-dimensional node representations to preserve original graph structures, has attracted extensive research interests. However, most existing graph embedding models represent nodes in Euclidean spaces, which cannot effectively preserve complex patterns, e.g., hierarchical structures. Very recently, several hyperbolic embedding models have been proposed to preserve the hierarchical information in negative curvature spaces. Nevertheless, existing hyperbolic models fail to model the asymmetric proximity between nodes. To address this, we investigate a new asymmetric hyperbolic network representation problem, which targets at jointly preserving the hierarchical structures and asymmetric proximity for general directed graphs. We solve this problem by proposing a novel Rotated Lorentzian Embedding (ROLE) model, which yields two main benefits. First, our model can effectively capture both implicit and explicit hierarchical structures that come from the network topology and category information of nodes, respectively. Second, it can model the asymmetric proximity using rotation transformations. Specifically, we represent each node with a Lorentzian embedding vector, and learn two rotation matrices to reflect the direction of edges. We conduct extensive experiments on four real-world directed graph datasets. Empirical results demonstrate that the proposed approach consistently outperforms various state-of-the-art embedding models. In particular, ROLE achieves HR@1 scores up to 19.8% higher and NDCG@5 scores up to 11.3% higher than the best baselines on the task of node recommendation.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available