2021
DOI: 10.1016/j.neucom.2021.01.139
|View full text |Cite
|
Sign up to set email alerts
|

Learning graph attention-aware knowledge graph embedding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(3 citation statements)
references
References 43 publications
0
3
0
Order By: Relevance
“…The initial knowledge graph is usually symbolic text description data, and we need to vectorize it so that the computer can use it for various tasks [38]- [40]. Knowledge embedded learning is trying to learn a projection from symbolic space to low-dimensional vectors, such as TransE and its variants [41]- [44].…”
Section: A Knowledge Embedded Learningmentioning
confidence: 99%
See 1 more Smart Citation
“…The initial knowledge graph is usually symbolic text description data, and we need to vectorize it so that the computer can use it for various tasks [38]- [40]. Knowledge embedded learning is trying to learn a projection from symbolic space to low-dimensional vectors, such as TransE and its variants [41]- [44].…”
Section: A Knowledge Embedded Learningmentioning
confidence: 99%
“…Baselines and Implementation Details We compare the proposed algorithm with the following methods: TransE 1 [8], TransH 1 [10], TransR 1 [11], TransD 1 [12], DKRL [21], TKRL [22], ConvE 2 , GAKE [38], CTransR 3 , PTransE [43], pTransE [52], TEKE [27], EDGE [53], TransP [58], AMC-NN [59], CRAN [60] and GAATs [61]. For TransE, TransH, TransD and TransR, we learn a separate embedding matrix using the positive training entity pairs.…”
Section: A Datasets and Experimental Setupmentioning
confidence: 99%
“…GraphSAGE minimizes information loss by concatenating vectors of neighbors rather than summing them into a single value in the process of neighbor aggregation [40,41]. GAT utilizes the concept of attention to individually deal with the importance of neighbor nodes or relations [21,[42][43][44][45][46][47]. Since each model has different characteristics and advantages, suitable models for KG alignment differ depending on the components and the topological structure of the KG.…”
Section: Knowledge Graph Alignmentmentioning
confidence: 99%