用搜索策略优化大模型匹配,高效准确地对齐知识库
Ontology Matching with Large Language Models and Prioritized Depth-First Search
- 结合检索、识别与提示的三步流程,用优先深度搜索精炼候选集
- 在五个任务中四项领先,最高提升17%,且减少大量大模型调用
- 无需领域调优或特定规则,适用于多种场景的知识对齐
本研究提出MILA方法,通过将检索-识别-提示流程嵌入优先深度优先搜索(PDFS)策略,解决大语言模型(LLM)在本体匹配(OM)中性能有限和计算开销高的问题。该方法仅对最模糊的候选对调用大模型,显著降低请求次数。在2023与2024年知识对齐评估竞赛(OAEI)的生物医学挑战任务中,MILA在五个无监督任务中的四项取得最高F-Measure,相比现有最优系统最高提升17%;性能优于或相当领先的有监督系统。其表现稳定,具备任务无关性,且无需领域特定启发式或微调即可实现高性能。
原文摘要 · Abstract (English)
Ontology matching (OM) plays a key role in enabling data interoperability and knowledge sharing, but it remains challenging due to the need for large training datasets and limited vocabulary processing in machine learning approaches. Recently, methods based on Large Language Model (LLMs) have shown great promise in OM, particularly through the use of a retrieve-then-prompt pipeline. In this approach, relevant target entities are first retrieved and then used to prompt the LLM to predict the final matches. Despite their potential, these systems still present limited performance and high computational overhead. To address these issues, we introduce MILA, a novel approach that embeds a retrieve-identify-prompt pipeline within a prioritized depth-first search (PDFS) strategy. This approach efficiently identifies a large number of semantic correspondences with high accuracy, limiting LLM requests to only the most borderline cases. We evaluated MILA using the biomedical challenge proposed in the 2023 and 2024 editions of the Ontology Alignment Evaluation Initiative. Our method achieved the highest F-Measure in four of the five unsupervised tasks, outperforming state-of-the-art OM systems by up to 17%. It also performed better than or comparable to the leading supervised OM systems. MILA further exhibited task-agnostic performance, remaining stable across all tasks and settings, while significantly reducing LLM requests. These findings highlight that high-performance LLM-based OM can be achieved through a combination of programmed (PDFS), learned (embedding vectors), and prompting-based heuristics, without the need of domain-specific heuristics or fine-tuning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。