Computer Science ›› 2023, Vol. 50 ›› Issue (3): 23-33.doi: 10.11896/jsjkx.220400255

• Special Issue of Knowledge Engineering Enabled By Knowledge Graph: Theory, Technology and System • Previous Articles     Next Articles

Context-aware Temporal Knowledge Graph Completion Based on Relation Constraints

WANG Jingbin, LAI Xiaolian, LIN Xinyu, YANG Xinyi   

  1. College of Computer and Data Science,Fuzhou University,Fuzhou 350108,China
  • Received:2022-04-25 Revised:2023-01-09 Online:2023-03-15 Published:2023-03-15
  • About author:WANG Jingbin,born in 1973,master,associate professor,is a member of China Computer Federation.Her main research interests include knowledge graph,relation reasoning,distributed data management and knowledge repesen-tation.
  • Supported by:
    National Natural Science Foundation of China(61672159) and Natural Science Foundation of Fujian Province(2021J01619).

Abstract: The existing temporal knowledge graph completion models only consider the structural information of the quadruple itself,ignoring the implicit neighbor information and the constraints of relationships on entities,which leads to the poor perfor-mance of the models on the temporal knowledge graph completion task.In addition,some datasets exhibit unbalanced distribution in time,which makes it difficult for model training to achieve a good balance.To address these problems,the paper proposes a context-aware model based on relation constraints(CARC).CARC solves the problem of an unbalanced distribution of datasets in time through an adaptive time granularity aggregation module and uses a neighbor-aggregator to integrate contextual information into entity embeddings to enhance the embedding representation of the entity.In addition,the quadruple relation constraint mo-dule is designed to make the embeddings of entities with the same relational constraints close to each other,while those with diffe-rent relational constraints are far away from each other,which further enhances the embedding representation of entities.Extensive experiments are conducted on several publicly available temporal datasets,and the experimental results prove the superiority of the proposed model.

Key words: Temporal knowledge graph, Link prediction, Time interval prediction, Relation constraint, Neighbor information, Time granularity

CLC Number: 

  • TP391
[1]XU C,NAYYERI M,ALKHOURY F,et al.TeRo:A Time-aware Knowledge Graph Embedding via Temporal Rotation[C]//Proceedings of the 28th International Conference on Computational Linguistics.Barcelona:International Committee on Computational Linguistics,2020:1583-1593.
[2]VASHISHTH S,SANYAL S,NITIN V,et al.Composition-based Multi-Relational Graph Convolutional Networks[C]//8th International Conference on Learning Representations.Addis Ababa:OpenReview.net,2020:1-16.
[3]HONG J D,CHEN W,ZHAO L.Knowledge RepresentationModel That Combining Entity Neighbor Information[J].Journal of Chinese Computer Systems,2020,41(8):1596-1601.
[4]XIE R,LIU Z,SUN M.Representation Learning of Knowledge Graphs with Hierarchical Types[C]//Proceedings of the 25th International Joint Conference on Artificial Intelligence.New York:Morgan Kaufmann,2016:2965-2971.
[5]MA S,DING J,JIA W,et al.Transt:Type-based multiple embedding representations for knowledge graph completion[C]//Joint European Conference on Machine Learning and Knowledge Discovery in Databases.Skopje:Cham:Springer,2017:717-733.
[6]NIU G,LI B,ZHANG Y,et al.AutoETER:Automated Entity Type Representation for Knowledge Graph Embedding[C]//Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing.Punta Cana:ACL,2020:1172-1181.
[7]LACROIX T,OBOZINSKI G,USUNIER N.Tensor Decompositions for temporal knowledge base completion[C]//8th International Conference on Learning Representations.Addis Ababa:OpenReview.net,2020:1-12.
[8]JAIN P,RATHI S,CHAKRABARTI S.Temporal Knowledge Base Completion:New Algorithms and Evaluation Protocols[C]//Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing.Punta Cana:ACL,2020:3733-3747.
[9]TROUILLON T,WELBL J,RIEDEL S,et al.Complex embeddings for simple link prediction[C]//Proceedings of Interna-tional Conference on Machine Learning.Sydney:PMLR Press,2016:2071-2080.
[10]MARCHEGGIANI D,TITOV I.Encoding Sentences with GraphConvolutional Networks for Semantic Role Labeling[C]//Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing.Brussels:ACL,2017:1506-1515.
[11]DASGUPTA S S,RAY S N,TALUKDAR P.Hyte:Hyper-plane-based temporally aware knowledge graph embedding[C]//Proceedings of the 2018 Conference on Empirical Me-thods in Matural Language Processing.Brussels:ACL,2018:2001-2011.
[12]BORDES A,USUNIER N,GARCIA-DURAN A,et al.Translating embeddings for modeling multi-relational data[C]//Ad-vances in Neural Information Processing Systems 26.Cam-bridge:The MIT Press,2013:2787-2795.
[13]GARCÍA-DURÁN A,DUMANČIĆ S,NIEPERT M.Learning sequence encoders for temporal knowledge graph completion[C]//Proceedings of the 2018 Conference on Empirical Methods in Matural Language Processing.Brussels:ACL,2018.
[14]GOEL R,KAZEMI S M,BRUBAKER M,et al.Diachronic embedding for temporal knowledge graph completion[C]//Proceedings of the 34th AAAI Conference on Artificial Intelligence.Palo Alto:AAAI Press,2020:3988-3995.
[15]SUN Z,DENG Z,NIE J,et al.RotatE:Knowledge Graph Embedding by Relational Rotation in Complex Space[C]//In 8th International Conference on Learning Representations.New Orleans:OpenReview.net,2019:1-18.
[16]MIKOLOV T,SUTSKEVER I,CHEN K,et al.Distributed rep-resentations of words and phrases and their compositionality[C]//Advances in Neural Information Processing Systems.Cambridge:The MIT Press,2013:3111-3119.
[1] 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.
[2] 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.
[3] 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.
[4] ZHAO Xue-lei, JI Xin-sheng, LIU Shu-xin, LI Ying-le, LI Hai-tao. Link Prediction Method for Directed Networks Based on Path Connection Strength [J]. Computer Science, 2022, 49(2): 216-222.
[5] HAN Xiao, ZHANG Zhe-qing, YAN Li. Temporal RDF Modeling Based on Relational Database [J]. Computer Science, 2022, 49(11): 90-97.
[6] HU Xin-tong, SHA Chao-feng, LIU Yan-jun. Post-processing Network Embedding Algorithm with Random Projection and Principal Component Analysis [J]. Computer Science, 2021, 48(5): 124-129.
[7] CHEN Heng, WANG Wei-mei, LI Guan-yu, SHI Yi-ming. Knowledge Graph Completion Model Using Quaternion as Relational Rotation [J]. Computer Science, 2021, 48(5): 225-231.
[8] GONG Zhui-fei, WEI Chuan-jia. Link Prediction of Complex Network Based on Improved AdaBoost Algorithm [J]. Computer Science, 2021, 48(3): 158-162.
[9] LI Xin-chao, LI Pei-feng, ZHU Qiao-ming. Directed Network Representation Method Based on Hierarchical Structure Information [J]. Computer Science, 2021, 48(2): 100-104.
[10] GONG Zhui-fei, WEI Chuan-jia. Complex Network Link Prediction Method Based on Topology Similarity and XGBoost [J]. Computer Science, 2021, 48(12): 226-230.
[11] HUANG Shou-meng. Heterogeneous Network Link Prediction Model Based on Supervised Learning [J]. Computer Science, 2021, 48(11A): 111-116.
[12] ZHAO Man, ZHAO Jia-kun, LIU Jin-nuo. Link Prediction Algorithm Based on Ego Networks Structure and Network Representation Learning [J]. Computer Science, 2021, 48(11A): 211-217.
[13] WANG Wen-bo, LUO Heng-li. Complete Graph Face Clustering Based on Graph Convolution Network [J]. Computer Science, 2021, 48(11A): 275-277.
[14] 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.
[15] 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.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!