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: Knowledge graph, Relation importance, Entity importance, Link prediction

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] WANG Hui, LE Zi-chun, GONG Xuan, WU Yu-kun, ZUO Hao. Review of Link Prediction Methods Based on Feature Classification [J]. Computer Science, 2020, 47(8): 302-312.
[2] BAI Xue, Nurbol and WANG Ya-dong. Map Analysis for Research Status and Development Trend on Network Security Situational Awareness [J]. Computer Science, 2020, 47(6A): 340-343.
[3] FU Kun, QIU Qian, ZHAO Xiao-meng, GAO Jin-hui. Event Detection Method Based on Node Evolution Staged Optimization [J]. Computer Science, 2020, 47(5): 96-102.
[4] YUAN Rong, SONG Yu-rong, MENG Fan-rong. Link Prediction Method Based on Weighted Network Topology Weight [J]. Computer Science, 2020, 47(5): 265-270.
[5] LI Xin-chao, LI Pei-feng, ZHU Qiao-ming. Knowledge Graph Representation Based on Improved Vector Projection Distance [J]. Computer Science, 2020, 47(4): 189-193.
[6] MA Yang, CHENG Guang-quan, LIANG Xing-xing, LI Yan, YANG Yu-ling, LIU Zhong. Improved SDNE in Weighted Directed Network [J]. Computer Science, 2020, 47(4): 233-237.
[7] LIU Miao-miao,HU Qing-cui,GUO Jing-feng,CHEN Jing. Survey of Link Prediction Algorithms in Signed Networks [J]. Computer Science, 2020, 47(2): 21-30.
[8] XIANG Ying, FENG Jun, XIA Pei-pei, LU Jia-min. Extraction of Water Conservancy Spatial Relationship Words Based on Bootstrapping [J]. Computer Science, 2020, 47(12): 131-138.
[9] WANG Hui, LE Zi-chun, GONG Xuan, ZUO Hao, WU Yu-kun. TNTlink Prediction Model Based on Feature Learning [J]. Computer Science, 2020, 47(12): 245-251.
[10] WU Yong, WANG Bin-jun, ZHAI Yi-ming, TONG Xin. Study on Co-citation Enhancing Directed Network Embedding [J]. Computer Science, 2020, 47(12): 279-284.
[11] XIAO Yong, QIAN Bin, ZHOU Mi. Cross-media Knowledge Graph Construction for Electric Power Metering Based on Semantic Correlation [J]. Computer Science, 2020, 47(11A): 126-131.
[12] ZHANG Chun-xia, PENG Cheng, LUO Mei-qiu, NIU Zhen-dong. Construction of Mathematics Course Knowledge Graph and Its Reasoning [J]. Computer Science, 2020, 47(11A): 573-578.
[13] CHEN Xiao-jun, XIANG Yang. Construction and Application of Enterprise Risk Knowledge Graph [J]. Computer Science, 2020, 47(11): 237-243.
[14] CHEN Xiao-jun, XIANG Yang. STransH:A Revised Translation-based Model for Knowledge Representation [J]. Computer Science, 2019, 46(9): 184-189.
[15] WU Jie-hua,SHEN Jing,ZHOU Bei. Community Features Based Balanced Modularity Maximization Social Link Prediction Model [J]. Computer Science, 2019, 46(3): 253-259.
Full text



[1] YANG Yu-qi, ZHANG Guo-an and JIN Xi-long. Dual-cluster-head Routing Protocol Based on Vehicle Density in VANETs[J]. Computer Science, 2018, 45(4): 126 -130 .
[2] HAN Kui-kui, XIE Zai-peng and LV Xin. Fog Computing Task Scheduling Strategy Based on Improved Genetic Algorithm[J]. Computer Science, 2018, 45(4): 137 -142 .
[3] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151 .
[4] ZHENG Xiu-lin, SONG Hai-yan and FU Yi-peng. Distinguishing Attack of MORUS-1280-128[J]. Computer Science, 2018, 45(4): 152 -156 .
[5] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[6] LUO Xiao-yang, HUO Hong-tao, WANG Meng-si and CHEN Ya-fei. Passive Image-splicing Detection Based on Multi-residual Markov Model[J]. Computer Science, 2018, 45(4): 173 -177 .
[7] ZHU Shu-qin, WANG Wen-hong and LI Jun-qing. Chosen Plaintext Attack on Chaotic Image Encryption Algorithm Based on Perceptron Model[J]. Computer Science, 2018, 45(4): 178 -181 .
[8] GUO Shuai, LIU Liang and QIN Xiao-lin. Spatial Keyword Range Query with User Preferences Constraint[J]. Computer Science, 2018, 45(4): 182 -189 .
[9] RAN Zheng, LUO Lei, YAN Hua and LI Yun. Study on Automatic Method for AUTOSAR Runnable Entity-task Mapping[J]. Computer Science, 2018, 45(4): 190 -195 .
[10] WEN Jun-hao, SUN Guang-hui and LI Shun. Study on Matrix Factorization Recommendation Algorithm Based on User Clustering and Mobile Context[J]. Computer Science, 2018, 45(4): 215 -219 .