用双通道学习提升知识图谱异常检测精度,解决数据错误问题。
ADKGD: Anomaly Detection in Knowledge Graphs with Dual-Channel Training
- 双通道学习:从实体和三元组视角联合优化表示
- 在WN18RR、FB15K、NELL-995上优于现有方法
- 适合需要高可靠性知识图谱的应用场景
大型语言模型(LLMs)依赖高质量训练数据,但常因知识缺失产生幻觉与错误。知识图谱(KGs)作为结构化外部信息源,可提升模型性能与可靠性。然而,从非结构化数据构建知识图谱时易引入错误,影响问答、推荐等下游任务。为此,本文提出双通道学习的异常检测算法ADKGD,通过实体视角与三元组视角协同增强表示学习,并采用跨层机制融合内部聚合与上下文信息。引入KL损失优化双通道评分函数。在WN18RR、FB15K和NELL-995三个真实数据集上验证,ADKGD显著优于现有先进算法。代码与数据集已公开。
原文摘要 · Abstract (English)
In the current development of large language models (LLMs), it is important to ensure the accuracy and reliability of the underlying data sources. LLMs are critical for various applications, but they often suffer from hallucinations and inaccuracies due to knowledge gaps in the training data. Knowledge graphs (KGs), as a powerful structural tool, could serve as a vital external information source to mitigate the aforementioned issues. By providing a structured and comprehensive understanding of real-world data, KGs enhance the performance and reliability of LLMs. However, it is common that errors exist in KGs while extracting triplets from unstructured data to construct KGs. This could lead to degraded performance in downstream tasks such as question-answering and recommender systems. Therefore, anomaly detection in KGs is essential to identify and correct these errors. This paper presents an anomaly detection algorithm in knowledge graphs with dual-channel learning (ADKGD). ADKGD leverages a dual-channel learning approach to enhance representation learning from both the entity-view and triplet-view perspectives. Furthermore, using a cross-layer approach, our framework integrates internal information aggregation and context information aggregation. We introduce a kullback-leibler (KL)-loss component to improve the accuracy of the scoring function between the dual channels. To evaluate ADKGD's performance, we conduct empirical studies on three real-world KGs: WN18RR, FB15K, and NELL-995. Experimental results demonstrate that ADKGD outperforms the state-of-the-art anomaly detection algorithms. The source code and datasets are publicly available at https://github.com/csjywu1/ADKGD.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。