Directed Knowledge Graph Embedding Using a Hybrid Architecture of Spatial and Spectral GNNs

Guoqiang Hou, Qiwen Yu, Fan Chen and Guang Chen ()
Additional contact information
Guoqiang Hou: College of Intelligent Systems Science and Engineering, Harbin Engineering University, Harbin 150001, China
Qiwen Yu: College of Intelligent Systems Science and Engineering, Harbin Engineering University, Harbin 150001, China
Fan Chen: College of Intelligent Manufacturing, Chongqing Vocational and Technical College of Industry and Trade, Chongqing 401120, China
Guang Chen: College of Intelligent Systems Science and Engineering, Harbin Engineering University, Harbin 150001, China

Mathematics, 2024, vol. 12, issue 23, 1-34

Abstract: Knowledge graph embedding has been identified as an effective method for node-level classification tasks in directed graphs, the objective of which is to ensure that nodes of different categories are embedded as far apart as possible in the feature space. The directed graph is a general representation of unstructured knowledge graphs. However, existing methods lack the ability to simultaneously approximate high-order filters and globally pay attention to the task-related connectivity between distant nodes for directed graphs. To address this limitation, a directed spectral graph transformer (DSGT), a hybrid architecture model, is constructed by integrating the graph transformer and directed spectral graph convolution networks. The graph transformer leverages multi-head attention mechanisms to capture the global connectivity of the feature graph from different perspectives in the spatial domain, which bridges the gap between frequency responses and, further, naturally couples the graph transformer and directed graph convolutional neural networks (GCNs). In addition to the inherent hard inductive bias of DSGT, we introduce directed node positional and structure-aware edge embedding to provide topological prior knowledge. Extensive experiments demonstrate that the DSGT exhibits state-of-the-art (SOTA) or competitive node-level representation capabilities across datasets of varying attributes and scales. Furthermore, the experimental results indicate that the homophily and degree of correlation of the nodes significantly influence the classification performance of the model. This finding opens significant avenues for future research.

Keywords: knowledge graph embeddings; hybrid architecture; graph transformer; directed spectral graph convolution networks; node-level representation learning (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/23/3689/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/23/3689/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:23:p:3689-:d:1528954

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().