Study and analysis of various link predictions in knowledge graph: A challenging overview

Author:

Khobragade Anish Rajkumar1,Ghumbre Shashikant U.2

Affiliation:

1. College of Engineering Pune, Savitribai Phule Pune University, Pune, India

2. Government College of Engineering and Research, Avasari Khurd, Savitribai Phule Pune University, Pune, India

Abstract

Knowledge Graph (KG) is the network which contains some topic-based entities, called nodes, and the associated information among the entities. Here, the concept in the knowledge graph is denoted by the tuple relationship, such that the ⟨entity1, predicate, entity2⟩. The entity in the knowledge graph is the abstract concepts based on the particular object, namely the organization, dataset, people, and some associated documentation. The big issue in the KG is that it consists of some incomplete information. The missing details can be identified by employing the knowledge graph completion (KGC) solution. KGC is the same as the link prediction concepts in the knowledge graphs. However, this concept is more complex that it does not predict the link relationship among the nodes but also the diversified information from the link relations. Hence this survey analyzes different methods of link prediction techniques, and this review provides a detailed review of 50 research papers concentrating on various methods, like embedding-based methods, deep learning methods, knowledge acquisition methods, ranking methods, and representation learning methods. The analysis is carried out with respect to the survey based on the publication year, research techniques, performance measures, dataset, toolset and achievement of the research methodologies. Also, the problems in the methods are explained in the research gaps and issues. Furthermore, the future extent of these research works is done based on the limitations identified from the existing research methods.

Publisher

IOS Press

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Human-Computer Interaction,Software

Reference58 articles.

1. Kotnis B, Nastase V. Analysis of the impact of negative sampling on link prediction in knowledge graphs. 2017.

2. Activelink: deep active learning for link prediction in knowledge graphs;Ostapuk;The World Wide Web Conference,2019

3. Zhang B, Choudhury S, Hasan MA, Ning X, Agarwal K, Purohit S, Cabrera PP. Trust from the past: Bayesian personalized ranking based link prediction in knowledge graphs. 2016.

4. Chen M, Zhang W, Zhang W, Chen Q, Chen H. Meta relational learning for few-shot link prediction in knowledge graphs. 2019.

5. Tay Y, Luu A, Hui SC. Non-parametric estimation of multiple embeddings for link prediction on dynamic knowledge graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence. February 2017; 31(1).

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Enhancing missing facts inference in knowledge graph using triplet subgraph attention embeddings;Applied Intelligence;2024-01

2. Balance Relation-Aware Attention Embedding Model for Knowledge Graph Completion;2023 IEEE Pune Section International Conference (PuneCon);2023-12-14

3. Analysis of Knowledge Graph Embedding Using Graph Attention Mechanism;2023 7th International Conference On Computing, Communication, Control And Automation (ICCUBEA);2023-08-18

4. Analysis of Negative Sampling Methods for Knowledge Graph Embedding;2023 7th International Conference On Computing, Communication, Control And Automation (ICCUBEA);2023-08-18

5. Infer the missing facts of D3FEND using knowledge graph representation learning;International Journal of Web Information Systems;2023-08-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3