基于大语言模型与适配器驱动的知识图谱补全算法OA
Knowledge Graph Completion Algorithm Based on Large Language Models and Adapter Driver
针对基于Transformer为骨干网络的知识图谱补全方法在前馈网络参数冗余、常识场景下尾实体识别困难以及对比学习嵌入存在偏差等问题,提出一种融合大语言模型与多正样本对比学习的适配器增强知识图谱补全算法.该算法通过在前馈网络中引入多头适配器减少冗余特征,并利用大型语言模型提升常识推理能力,同时通过多正样本对比学习校正嵌入偏差.实验结果表明,相比于当前最佳模型,该算法在数据集WN18RR和FB15k_237上的MRR分别提高了 5.4%和9.2%,在更复杂的数据集Wikidata5M下的转导与归纳设定中分别提高3.6%和6.7%,并在低资源与复杂场景中展现出更佳的泛化能力.
Aiming at the problems that the knowledge graph completion method based on Transformer as the backbone network,included parameter redundancy in feed-forward networks,difficulties in identifying tail entities under commonsense scenarios,and embedding biases in contrastive learning,we proposed an adapter-enhanced knowledge graph completion algorithm that integrated large language models with multi-positive sample contrastive learning.The algorithm reduced redundant features by introducing multi-head adapters in feed-forward network,and utilized large language models to enhance commonsense reasoning ability.At the same time,it corrected embedding biases through multi-positive sample contrastive learning.Experimental results show that,compared to the current state-of-the-art models,the algorithm improves MRR by 5.4%and 9.2%on WN18RR and FB15k-237 datasets,respectively,and by 3.6%and 6.7%in transductive and inductive settings on the more complex Wikidata5M dataset,respectively,and demonstrates superior generalization ability under low-resource and complex scenarios.
姜昀奇;韩晓同;田原
吉林大学计算机科学与技术学院,长春 130012吉林大学人工智能学院,长春 130012吉林大学人工智能学院,长春 130012
信息技术与安全科学
知识图谱补全知识图谱大语言模型对比学习适配器学习
knowledge graph completionknowledge graphlarge language modelcontrastive learningadapter learning
《吉林大学学报(理学版)》 2026 (2)
291-300,10
国家重点研发计划项目(批准号:2023YFF0905400)、国家自然科学基金"叶企孙"科学基金(批准号:U2341229)和吉林省发展和改革委员会基金(批准号:2024C003).
评论