Computer Science ›› 2020, Vol. 47 ›› Issue (11): 231-236.doi: 10.11896/jsjkx.200800195

• Artificial Intelligence • Previous Articles     Next Articles

Knowledge Graph Completion Model Based on Triplet Importance Integration

LI Zhong-wen1, DING Ye 2, HUA Zhong-yun1, LI Jun-yi1, LIAO Qing1   

  1. 1 Department of Computer Science and Technology,Harbin Institute of Technology,Shenzhen,Shenzhen,Guangdong 518055,China
    2 Department of Cyberspace Security,Dongguan University of Technology,Dongguan,Guangdong 523808,China
  • Received:2020-05-31 Revised:2020-09-16 Online:2020-11-15 Published:2020-11-05
  • About author:LI Zhong-wen,born in 1996,postgra-duate.His main research interests include artificial intelligence and natural language processing.
    LIAO Qing,born in 1988,Ph.D,assistant professor.Her research interests include artificial intelligence and data mining.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China(U1711261).

Abstract: Knowledge graph is a popular research area related to artificial intelligence.Knowledge graph completion is the completion of missing entities given head or tail entities and corresponding relations.Translation models (such as TransE,TransH and TransR) are one of the most commonly used completion methods.However,most of the existing completion models ignore the feature of the importance of the triplets in the knowledge graph during the completion process.This paper proposes a novel knowledge graph completion model,ImpTransE,which takes into account the importance feature in triplets,and designs the entity importance ranking method KGNodeRank and the multi-grained relation importance estimation method MG-RIE,to estimate the entity importance and relation importance,respectively.Specifically,the KGNodeRank method estimates the entity node importance ranking by considering both the importance of the associated nodes and the probability that their importance is transmitted,while the MG-RIE method considers multi-order relation importance to provide a reasonable estimate of the overall importance of the relation.ImpTransE takes into account the entity importance and relation importance features of triplets,so that differentle-vels of attention are given to different triplets during the learning process,which improves the learning performance of the ImpTransE model and thus achieves better completion performance.Experimental results show that ImpTransE model has the best completion performance in most of the metrics on the two knowledge graph datasets compared with the five comparison models,and completion performance of different datasets is consistently improved.

Key words: Entity importance, Knowledge graph, Link prediction, Relation importance

CLC Number: 

  • TP391
[1] MILLER G A.WordNet:a lexical database for English[J].Communications of the ACM,1995,38(11):39-41.
[2] BOLLACKER K,EVANS C,PARITOSH P,et al.Freebase:acollaboratively created graph database for structuring human knowledge[C]//Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data.Association for Computing Machinery,2008:1247-1250.
[3] FABIAN M S,GJERGJI K,GERHARD W.Yago:A core of semantic knowledge unifying wordnet and wikipedia[C]//16th International World Wide Web Conference,WWW.Association for Computing Machinery,2007:697-706.
[4] BORDES A,WESTON J,COLLOBRET R,et al.Learningstructured embeddings of knowledge bases[C]//Conference on Artificial Intelligence.2011 (CONF).
[5] SOCHER R,CHEN D,MANNING C D,et al.Reasoning with neural tensor networks for knowledge base completion[C]//Advances in Neural Information Processing Systems.2013:926-934.
[6] BORDES A,USUNIER N,GARCIA-DURAN A,et al.Translating embeddings for modeling multi-relational data[C]//Advances in Neural Information Processing Systems.MIT Press,2013:2787-2795.
[7] WANG Z,ZHANG J,FENG J,et al.Knowledge graph embedding by translating on hyperplanes[C]//Twenty-Eighth AAAI Conference on Artificial Intelligence.AAAI,2014:1112-1119.
[8] LIN Y,LIU Z,SUN M,et al.Learning entity and relation embeddings for knowledge graph completion[C]//Twenty-ninth AAAI Conference on Artificial Intelligence.AAAI,2015:2181-2187.
[9] PARK N,KAN A,DONG X L,et al.Estimating node importance in knowledge graphs using graph neural networks[C]//Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining.Association for Computing Machinery,2019:596-606.
[10] YANG B,YIH W,HE X,et al.Embedding entities and relations for learning and inference in knowledge bases[J].arXiv:1412.6575.
[11] TROUILLON T,WELBL J,RIEDEL S,et al.Complex embeddings for simple link prediction[C]//International Conference on Machine Learning (ICML).2016.
[12] PAGE L,BRIN S,MOTWANI R,et al.The pagerank citation ranking:Bringing order to the web[R].Stanford:StanfordInfoLab,1999.
[13] ZHANG Z,CAI J,ZHANG Y,et al.Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction[J].arXiv:1911.09419.
[14] OH B,SEO S,LEE K H.Knowledge graph completion by context-aware convolutional learning with multi-hop neighborhoods[C]//Proceedings of the 27th ACM International Conference on Information and Knowledge Management.2018:257-266.
[15] ZHU Y,LIU H,WU Z,et al.Representation Learning with Ordered Relation Paths for Knowledge Graph Completion[J].arXiv:1909.11864.
[16] WANG C C,CHENG P J.Translating Representations ofKnowledge Graphs with Neighbors[C]//The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval.Association for Computing Machinery,2018:917-920.
[17] FAN M,ZHOU Q,CHANG E,et al.Transition-based Knowledge Graph Embedding with relational mapping properties[C]//Proceedings of the 28th Pacific Asia Conference on Language,Information and Computing.PACLIC,2014:328-337.
[18] HAN X,CAO S,LV X,et al.Openke:An Open Toolkit forKnowledge Embedding[C]//Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing:System Demonstrations.2018:139-144.
[1] RAO Zhi-shuang, JIA Zhen, ZHANG Fan, LI Tian-rui. Key-Value Relational Memory Networks for Question Answering over Knowledge Graph [J]. Computer Science, 2022, 49(9): 202-207.
[2] WU Zi-yi, LI Shao-mei, JIANG Meng-han, ZHANG Jian-peng. Ontology Alignment Method Based on Self-attention [J]. Computer Science, 2022, 49(9): 215-220.
[3] KONG Shi-ming, FENG Yong, ZHANG Jia-yun. Multi-level Inheritance Influence Calculation and Generalization Based on Knowledge Graph [J]. Computer Science, 2022, 49(9): 221-227.
[4] SONG Jie, LIANG Mei-yu, XUE Zhe, DU Jun-ping, KOU Fei-fei. Scientific Paper Heterogeneous Graph Node Representation Learning Method Based onUnsupervised Clustering Level [J]. Computer Science, 2022, 49(9): 64-69.
[5] HUANG Li, ZHU Yan, LI Chun-ping. Author’s Academic Behavior Prediction Based on Heterogeneous Network Representation Learning [J]. Computer Science, 2022, 49(9): 76-82.
[6] XU Yong-xin, ZHAO Jun-feng, WANG Ya-sha, XIE Bing, YANG Kai. Temporal Knowledge Graph Representation Learning [J]. Computer Science, 2022, 49(9): 162-171.
[7] QIN Qi-qi, ZHANG Yue-qin, WANG Run-ze, ZHANG Ze-hua. Hierarchical Granulation Recommendation Method Based on Knowledge Graph [J]. Computer Science, 2022, 49(8): 64-69.
[8] WANG Jie, LI Xiao-nan, LI Guan-yu. Adaptive Attention-based Knowledge Graph Completion [J]. Computer Science, 2022, 49(7): 204-211.
[9] MA Rui-xin, LI Ze-yang, CHEN Zhi-kui, ZHAO Liang. Review of Reasoning on Knowledge Graph [J]. Computer Science, 2022, 49(6A): 74-85.
[10] DENG Kai, YANG Pin, LI Yi-zhou, YANG Xing, ZENG Fan-rui, ZHANG Zhen-yu. Fast and Transmissible Domain Knowledge Graph Construction Method [J]. Computer Science, 2022, 49(6A): 100-108.
[11] DU Xiao-ming, YUAN Qing-bo, YANG Fan, YAO Yi, JIANG Xiang. Construction of Named Entity Recognition Corpus in Field of Military Command and Control Support [J]. Computer Science, 2022, 49(6A): 133-139.
[12] XIONG Zhong-min, SHU Gui-wen, GUO Huai-yu. Graph Neural Network Recommendation Model Integrating User Preferences [J]. Computer Science, 2022, 49(6): 165-171.
[13] ZHONG Jiang, YIN Hong, ZHANG Jian. Academic Knowledge Graph-based Research for Auxiliary Innovation Technology [J]. Computer Science, 2022, 49(5): 194-199.
[14] LI Yong, WU Jing-peng, ZHANG Zhong-ying, ZHANG Qiang. Link Prediction for Node Featureless Networks Based on Faster Attention Mechanism [J]. Computer Science, 2022, 49(4): 43-48.
[15] LIANG Jing-ru, E Hai-hong, Song Mei-na. Method of Domain Knowledge Graph Construction Based on Property Graph Model [J]. Computer Science, 2022, 49(2): 174-181.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!