Hyperbolic Heterogeneous Graph Attention Networks
원문 초록
Most previous heterogeneous graph embedding models represent elements in a heterogeneous graph as vector representations in a low-dimensional Euclidean space. However, because heterogeneous graphs inherently possess complex structures, such as hierarchical or power-law structures, distortions can occur when representing them in Euclidean space. To overcome this limitation, we propose Hyperbolic Heterogeneous Graph Attention Networks (HHGAT) that learn vector representations in hyperbolic spaces with meta-path instances. We conducted experiments on three real-world heterogeneous graph datasets, demonstrating that HHGAT outperforms state-of-the-art heterogeneous graph embedding models in node classification and clustering tasks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Unsupervised Graph Clustering with Deep Structural Entropy
Speaker Diarization with Overlapping Community Detection Using Graph Attention Networks and Label Propagation Algorithm
Simple yet Effective Graph Distillation via Clustering
Semantic tradeoff for heterogeneous graph embedding
HGATE: Heterogeneous Graph Attention Auto-Encoders
MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph
토론
이 논문과 연결된 포럼 글이 아직 없습니다.