.png){kind=icon}
返回
Complex graph convolutional network for link prediction in knowledge graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.116796.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Knowledge graph (KG) embedding models map nodes and edges to fixed-length vectors and obtain the similarity of nodes as the output of a scoring function to predict missing links between nodes. KG embedding methods based on graph convolutional networks (GCNs) have recently gained significant attention due to their ability to add information of neighboring nodes into the nodes' embeddings. However, existing GCNs are primarily based on real-valued embeddings, which have high distortion, particularly when modeling graphs with varying geometric structures. In this paper, we propose complex graph convolutional network (ComplexGCN), a novel extension of the standard GCNs in complex space to combine the expressiveness of complex geometry with GCNs for improving the representation quality of KG components. The proposed ComplexGCN comprises a set of complex graph convolutional layers and a complex scoring function based on PARATUCK2 decomposition: the former includes information of neighboring nodes into the nodes' embeddings, while the latter leverages these embeddings to predict new links between nodes. The proposed model demonstrates enhanced performance compared to existing methods on the two recent standard link prediction datasets.
Keyword:
Knowledge graph
Link prediction
Graph convolutional network
Complex embeddings
Tensor decomposition
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Kinematic analysis of limb movements in neuropsychological research: Subtle deficits and recovery of function.神经心理学研究中肢体运动的运动学分析: 细微的缺陷和功能的恢复。
PREAI
分享收藏
Impact of Age at Administration, Lysosomal Storage, and Transgene Regulatory Elements on AAV2/8-Mediated Rat Liver Transduction.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏分享收藏
查看更多内容