一种可定制的不精确子图匹配算法用于带属性图
A customizable inexact subgraph matching algorithm for attributed graphs
AI总结:
本文提出一种可定制的不精确子图匹配算法,利用节点和边属性缩小搜索空间,适用于含噪声和错误的数据集,通过可修改的图编辑距离成本函数实现灵活的子图匹配。
摘要:
图提供了一种自然的数据表示方式,通过编码对象及其关系的信息。随着数据量的不断增长,定位特定对象间关系模式变得必要。给定一个较大的图和一个较小的图,希望在较大的目标图中识别较小的查询图的实例。这项任务称为子图识别或匹配。子图匹配在生物信息学、二进制分析、模式识别和计算机视觉等领域有帮助。在这些应用中,数据集经常包含噪声和错误,因此精确的子图匹配算法不适用。本文介绍了一种新的可定制的不精确子图匹配算法。我们的算法利用通常存在于现实数据集中的节点和边属性来缩小搜索空间。该算法通过使用可修改的图编辑距离成本函数来配对节点,从而在可以执行的子图匹配类型和可以处理的数据集类型上具有灵活性。我们在家族树图和控制流图上展示了其有效性。
英文摘要:
Graphs provide a natural way to represent data by encoding information about objects and the relationships between them. With the ever-increasing amount of data collected and generated, locating specific patterns of relationships between objects in a graph is often required. Given a larger graph and a smaller graph, one may wish to identify instances of the smaller query graph in the larger target graph. This task is called subgraph identification or matching. Subgraph matching is helpful in areas such as bioinformatics, binary analysis, pattern recognition, and computer vision. In these applications, datasets frequently contain noise and errors, thus exact subgraph matching algorithms do not apply. In this paper we introduce a new customizable algorithm for inexact subgraph matching. Our algorithm utilizes node and edge attributes which are often present in real-world datasets to narrow down the search space. The algorithm is flexible in the type of subgraph matching it can perform and the types of datasets it can process by its use of a modifiable graph edit distance cost function for pairing nodes. We show its effectiveness on family trees graphs and control-flow graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。