2016 IEEE Congress on Evolutionary Computation (CEC) 2016
DOI: 10.1109/cec.2016.7744426
|View full text |Cite
|
Sign up to set email alerts
|

A re-ranking model for accurate knowledge base completion with knowledge base schema and web statistic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0
1

Year Published

2020
2020
2020
2020

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 16 publications
0
2
0
1
Order By: Relevance
“…Fan 等 [110] 在嵌入学习中将实体和提及一起进行训练来补充语义信息. Choi 等 [111] 引入了 Web 中的统计信息和 知识库的模式信息. Huang 等 [112] 则引入了 PRA 方法中的路径可能性信息.…”
Section: 翻译法unclassified
“…Fan 等 [110] 在嵌入学习中将实体和提及一起进行训练来补充语义信息. Choi 等 [111] 引入了 Web 中的统计信息和 知识库的模式信息. Huang 等 [112] 则引入了 PRA 方法中的路径可能性信息.…”
Section: 翻译法unclassified
“…However, their method still does not cover n-to-n relations, since it is based on knowledge graph embedding which utilizes the characteristics of 1-to-1 relations. On the other hand, Choi et al proposed a re-ranking model that uses both internal and external information of a knowledge graph for more accurate knowledge base completion [12]. Their model first extracts top-k candidates according to the plausibility computed by knowledge graph embedding.…”
Section: Introductionmentioning
confidence: 99%
“…This paper proposes a sole ranking model that adopts a committee of knowledge graph embeddings for accurate knowledge base completion. Unlike previous work that represents knowledge base completion as a re-ranking task [12], we formulate it as a ranking task. Given a knowledge base, the proposed model generates candidate facts, and then the plausibility of each candidate is determined by a committee of knowledge graph embeddings, not by a single knowledge graph embedding.…”
Section: Introductionmentioning
confidence: 99%