Knowledge Base Completion by Learning to Rank Model

被引:1
作者
Huang, Yong [1 ,2 ]
Wang, Zhichun [1 ,2 ]
机构
[1] Beijing Normal Univ, Beijing Adv Innovat Ctr Future Educ, XinJieKouWai St 19, Beijing 100875, Peoples R China
[2] Beijing Normal Univ, Coll Informat Sci & Technol, XinJieKouWai St 19, Beijing 100875, Peoples R China
来源
KNOWLEDGE GRAPH AND SEMANTIC COMPUTING: LANGUAGE, KNOWLEDGE, AND INTELLIGENCE, CCKS 2017 | 2017年 / 784卷
关键词
Knowledge base completion; Path ranking; Learning to rank;
D O I
10.1007/978-981-10-7359-5_1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Knowledge base (KB) completion aims to predict new facts from the existing ones in KBs. There are many KB completion approaches, one of the state-of-art approaches is Path Ranking Algorithm (PRA), which predicts new facts based on path types connecting entities. PRA treats the relation prediction as a classification problem, and logistic regression is used as the classification model. In this work, we consider the relation prediction as a ranking problem; learning to rank model is trained on path types to predict new facts. Experiments on YAGO show that our proposed approach outperforms approaches using classification models.
引用
收藏
页码:1 / 6
页数:6
相关论文
共 16 条
  • [11] A Review of Relational Machine Learning for Knowledge Graphs
    Nickel, Maximilian
    Murphy, Kevin
    Tresp, Volker
    Gabrilovich, Evgeniy
    [J]. PROCEEDINGS OF THE IEEE, 2016, 104 (01) : 11 - 33
  • [12] Quinlan J. R., 1993, Program for Machine Learning, P1, DOI DOI 10.1007/3-540-56602-3124
  • [13] YAGO: A Large Ontology from Wikipedia and WordNet
    Suchanek, Fabian M.
    Kasneci, Gjergji
    Weikum, Gerhard
    [J]. JOURNAL OF WEB SEMANTICS, 2008, 6 (03): : 203 - 217
  • [14] Wang Q, 2016, PROCEEDINGS OF THE 54TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 1, P1308
  • [15] Wang Z., 2015, ARXIV
  • [16] Wang Z, 2014, AAAI CONF ARTIF INTE, P1112