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

KG-MDL:利用MDL原则在知识图谱中挖掘图模式

KG-MDL: Mining Graph Patterns in Knowledge Graphs with the MDL Principle

Leiden University(莱顿大学);Univ Rennes(雷恩大学);INSA Rennes(雷恩国立应用科学学院);CNRS(法国国家科学研究中心);Inria(法国国家信息与自动化研究所)

Francesco Bariatti, Peggy Cellier, Sébastien Ferré

AI总结:

本文提出KG-MDL方法,基于最小描述长度原则在知识图谱中挖掘图模式,以无参数和随时方式生成人类可读且具有描述性的模式集合,解决模式爆炸问题并揭示数据模式与事实特征。

摘要:

如今,越来越多的数据以知识图谱(KGs)的形式可用。虽然这种数据模型支持高级推理和查询,但由于其规模和复杂性,它们仍然难以挖掘。图挖掘方法可用于从知识图谱中提取模式。然而这带来了两个主要问题。首先,图挖掘方法往往会提取出过多的模式,使人类分析师难以解释(模式爆炸)。其次,现实生活中的知识图谱往往不同于图挖掘中通常处理的图:它们是多重图,其顶点度往往遵循幂律分布,并且它们建模知识的方式可能产生虚假模式。最近,一种名为GraphMDL+的图挖掘方法被提出,利用最小描述长度(MDL)原则来解决模式爆炸问题。然而,GraphMDL+与其他图挖掘方法一样,在没有进行适配的情况下并不适合知识图谱。在本文中,我们提出了KG-MDL,这是一种基于MDL原则的图模式挖掘方法,给定一个知识图谱,它能够生成一个人类可读规模且具有描述性的图模式集合,并且以无参数和随时(anytime)的方式实现。我们报告了在中等规模知识图谱上的实验,表明我们的方法生成的模式集合既足够小以供人类解释,又能够描述知识图谱。我们展示了所提取的模式突出了数据的相关特征:既包括用于创建数据的模式(schema),也包括其包含的具体事实。我们还讨论了与在其他类型图数据上挖掘图模式相比,在知识图谱上挖掘图模式所涉及的问题。

英文摘要:

Nowadays, increasingly more data are available as knowledge graphs (KGs). While this data model supports advanced reasoning and querying, they remain difficult to mine due to their size and complexity. Graph mining approaches can be used to extract patterns from KGs. However this presents two main issues. First, graph mining approaches tend to extract too many patterns for a human analyst to interpret (pattern explosion). Second, real-life KGs tend to differ from the graphs usually treated in graph mining: they are multigraphs, their vertex degrees tend to follow a power-law, and the way in which they model knowledge can produce spurious patterns. Recently, a graph mining approach named GraphMDL+ has been proposed to tackle the problem of pattern explosion, using the Minimum Description Length (MDL) principle. However, GraphMDL+, like other graph mining approaches, is not suited for KGs without adaptations. In this paper we propose KG-MDL, a graph pattern mining approach based on the MDL principle that, given a KG, generates a human-sized and descriptive set of graph patterns, and so in a parameter-less and anytime way. We report on experiments on medium-sized KGs showing that our approach generates sets of patterns that are both small enough to be interpreted by humans and descriptive of the KG. We show that the extracted patterns highlight relevant characteristics of the data: both of the schema used to create the data, and of the concrete facts it contains. We also discuss the issues related to mining graph patterns on knowledge graphs, as opposed to other types of graph data.

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

↑