paper-with-me

홈 › Papers

DUPLEX: Dual GAT for Complex Embedding of Directed Graphs

2024-06-08 · Zhaoru Ke, Hang Yu, Jianguo Li, Haipeng Zhang

Current directed graph embedding methods build upon undirected techniques but often inadequately capture directed edge information, leading to challenges such as: (1) Suboptimal representations for nodes with low in/out-degrees, due to the insufficient neighbor interactions; (2) Limited inductive ability for representing new nodes post-training; (3) Narrow generalizability, as training is overly coupled with specific tasks. In response, we propose DUPLEX, an inductive framework for complex embeddings of directed graphs. It (1) leverages Hermitian adjacency matrix decomposition for comprehensive neighbor integration, (2) employs a dual GAT encoder for directional neighbor modeling, and (3) features two parameter-free decoders to decouple training from particular tasks. DUPLEX outperforms state-of-the-art models, especially for nodes with sparse connectivity, and demonstrates robust inductive capability and adaptability across various tasks. The code is available at https://github.com/alipay/DUPLEX.

📄 PDF Abstract BibTeX arXiv:2406.05391

Code (1)

alipay/duplex 공식 구현 pytorch

Tasks

Graph Embedding

Methods 이 논문이 사용한 방법론

GAT A Graph Attention Network (GAT) is a neural network architecture that operates on graph-structured data, leveraging masked self-attentional layers to address the shortcomings…

Similar Papers 제목 키워드 기반

Embedding Directed Graphs in Potential Fields Using FastMap-D

2020-06-04 · Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar

Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problems posed on undirected graphs. However, E…

Hyperbolic Disk Embeddings for Directed Acyclic Graphs

2019-02-12 · Ryota Suzuki, Ryusuke Takahama, Shun Onoda

Obtaining continuous representations of structural data such as directed acyclic graphs (DAGs) has gained attention in machine learning and artificial intelligence. However, embedding complex DAGs in which both ancestors…

Estimating Vector Fields on Manifolds and the Embedding of Directed Graphs

2014-05-30 · Dominique Perrault-Joncas, Marina Meila

This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed w…

Graph Embedding

A Unified Spectral Sparsification Framework for Directed Graphs

2021-01-01 · Ying Zhang, Zhiqiang Zhao, Zhuo Feng

Recent spectral graph sparsification research allows constructing nearly-linear-sized subgraphs that can well preserve the spectral (structural) properties of the original graph, such as the first few eigenvalues and eig…

Low-dimensional statistical manifold embedding of directed graphs

2019-05-24 · ICLR 2020 1 · Thorben Funke, Tian Guo, Alen Lancic, Nino Antulov-Fantulin

We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a pro…