Author
Listed:
- Huang Peng
(Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China)
- Pengfei Zhang
(National Key Laboratory of Information Systems Engineering, National University of Defense Technology, Changsha 410073, China)
- Jiuyang Tang
(Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China)
- Hao Xu
(Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China)
- Weixin Zeng
(Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China)
Abstract
Conflict resolution for knowledge graphs (KGs) is a critical technique in knowledge fusion, ensuring the resolution of conflicts between existing KGs and external knowledge while maintaining post-fusion accuracy. However, current approaches often encounter difficulties with external triples involving unseen entities due to limited knowledge. Moreover, current methodologies typically overlook conflict detection prior to resolution, a crucial step for accurate truth inference. This paper introduces CRDL, an innovative approach that leverages conflict detection and large language models (LLMs) to identify truths. By employing conflict detection, we implement precise filtering strategies tailored to various types of relations and attributes. By designing prompts and injecting relevant information into an LLM, we identify triples with unseen entities. Experimental results demonstrate the superiority of CRDL over baseline methods. Specifically, our method surpasses the state-of-the-art by achieving a 56.4% improvement in recall and a 68.2% increase in F1-score. These results clearly illustrate the enhanced performance and effectiveness of our approach. Additionally, ablation studies and further analyses underscore the importance of the components within CRDL.
Suggested Citation
Huang Peng & Pengfei Zhang & Jiuyang Tang & Hao Xu & Weixin Zeng, 2024.
"Detect-Then-Resolve: Enhancing Knowledge Graph Conflict Resolution with Large Language Model,"
Mathematics, MDPI, vol. 12(15), pages 1-15, July.
Handle:
RePEc:gam:jmathe:v:12:y:2024:i:15:p:2318-:d:1441989
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:15:p:2318-:d:1441989. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.