arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.07727cs.AIcs.DCcs.DScs.LGcs.PF
收藏

高效并行多跳推理:一种可扩展的知识图谱分析方法

Efficient Parallel Multi-Hop Reasoning: A Scalable Approach for Knowledge Graph Analysis

Intel Corporation(英特尔公司)

Jesmin Jahan Tithi, Fabio Checconi, Fabrizio Petrini

AI总结:

针对大规模知识图谱上多跳推理的时间效率问题,本文提出利用领域学习嵌入并行寻找三跳查询前K条路径的算法,并在Intel与AMD架构上验证其高性能与可扩展性。

摘要:

多跳推理(MHR)是人工智能和自然语言处理中的一个过程,系统需要执行多个推理步骤以得出结论或答案。在知识图谱或数据库语境中,它涉及遍历多个相互链接的实体和关系,以理解复杂查询或执行需要更深层次理解的任务。多跳推理是问答、知识库补全和链接预测等多种应用中的关键功能,并已在人工智能、机器学习和图分析领域引起广泛关注。\n本文聚焦于在大规模图上优化MHR的时间效率,区别于传统上对准确率这一正交目标的强调。我们提出一种新颖的并行算法,利用特定领域的学习型嵌入来高效识别知识图谱中顶点之间的前K条路径,从而为三跳查询找到最佳答案。我们的贡献包括:(1)提出一种新的并行算法,以增强MHR的性能、可扩展性和效率。(2)通过实证结果证明该算法在前沿Intel和AMD架构上的优越性能。\n我们通过一个案例研究展示该算法的实用性,该案例旨在识别深度学习领域潜在图灵奖得主的学术隶属关系,突显其处理复杂实体关系的能力。这表明我们的方法有潜力实现高性能MHR,有助于应对现代知识图谱日益增长的复杂性。

英文摘要:

Multi-hop reasoning (MHR) is a process in artificial intelligence and natural language processing where a system needs to make multiple inferential steps to arrive at a conclusion or answer. In the context of knowledge graphs or databases, it involves traversing multiple linked entities and relationships to understand complex queries or perform tasks requiring a deeper understanding. Multi-hop reasoning is a critical function in various applications, including question answering, knowledge base completion, and link prediction. It has garnered significant interest in artificial intelligence, machine learning, and graph analytics. This paper focuses on optimizing MHR for time efficiency on large-scale graphs, diverging from the traditional emphasis on accuracy which is an orthogonal goal. We introduce a novel parallel algorithm that harnesses domain-specific learned embeddings to efficiently identify the top K paths between vertices in a knowledge graph to find the best answers to a three-hop query. Our contributions are: (1) We present a new parallel algorithm to enhance MHR performance, scalability and efficiency. (2) We demonstrate the algorithm's superior performance on leading-edge Intel and AMD architectures through empirical results. We showcase the algorithm's practicality through a case study on identifying academic affiliations of potential Turing Award laureates in Deep Learning, highlighting its capability to handle intricate entity relationships. This demonstrates the potential of our approach to enabling high-performance MHR, useful to navigate the growing complexity of modern knowledge graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑