DUPLEX: Dual GAT for Complex Embedding of Directed Graphs
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding
Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
AdvSGM: Differentially Private Graph Learning via Adversarial Skip-gram Model
Multi-dataset and Transfer Learning Using Gene Expression Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.