2017
DOI: 10.1109/access.2017.2759139
|View full text |Cite
|
Sign up to set email alerts
|

Knowledge Graph Embedding by Dynamic Translation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 31 publications
(13 citation statements)
references
References 17 publications
0
13
0
Order By: Relevance
“…, instead of projection matrices, to concurrently prevent the overfitting of simple relational facts and the underfitting of complex relational facts. Its scoring function is [18] and DT [19] design the flexible translation principles and the dynamic translation principles, respectively. To some extent, they improve the ability to handle complex relational facts.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…, instead of projection matrices, to concurrently prevent the overfitting of simple relational facts and the underfitting of complex relational facts. Its scoring function is [18] and DT [19] design the flexible translation principles and the dynamic translation principles, respectively. To some extent, they improve the ability to handle complex relational facts.…”
Section: Related Workmentioning
confidence: 99%
“…(1) G sub ⟵ Initialize empty set for subgraph (2) while n > 0 do (3) τ ⟵ 128 //Set the maximum iterations (4) r ⟵ Random sample a relation r ∈ R (5) E r ⟵ Select semantics related entities (6) n s , n t ⟵ Generate subgraph scale hyperparameters 7G ⟵ ∅//Initialize empty set for selected triplets (8) while |G| < n t and τ > 0 do (9) count ⟵ 0 (10) while count < n s do//Control the scale of subgraphs (11) e ⟵ Randomly sample an entity e ∈ E r (12) t ⟵ Randomly select a relevant triplet t(e) from G (13) G ⟵ G∪t //Add a selected triplet (14) count ⟵ count + 1 (15) end while (16) E r ⟵ All entities collected in G (17) τ ⟵ τ − 1 (18) end while (19) if G � G then (4) c, α ⟵ global-view margin c 0 , global-view learning rate α 0 (5) else (6) c, α ⟵ Randomly initialize local-view margin and learning rate (7) end if (8) E, R ⟵ All entities and relations in G respectively (9) e, r ⟵ Initialize uniform (−6…”
Section: Multiview Fusion Strategymentioning
confidence: 99%
See 1 more Smart Citation
“…Results are shown in Table 5, where [*] means that data are taken from related publications. Results of NTN, TranSparse-S and ConvKB are from Nguyen et al [42], results of TransD are from Ji et al [25], and results of TranSparse-US are from Chang et al [11] (For TranSparse, 'S' and 'US' mean structured and unstructured patterns, respectively). Implementations of DistMult and ConvE are from Dettmers et al [15].…”
Section: Hyper-parameters Tuningmentioning
confidence: 99%
“…Wikipedia is used as background knowledge by Yang, L. [33] to learn topics with respect to all target categories for short text classification. In deep learning neural networks, background knowledge is often existed in different forms in NLP tasks, such as knowledge graph, which contained a set of interconnected typed entities and their attributes [34,35]. Knowledge graph was proposed by google in 2012, which aimed to enable search engine to gain insight into the semantic information behind queries and improve the quality of answers returned.…”
Section: Related Workmentioning
confidence: 99%