arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.20212cs.DS
收藏

基于结构与属性相似性的图匹配

Graph matching based on similarities in structure and attributes

Raphaël Candelier

AI总结:

本文提出 GASM 算法,在统一框架中融合图结构与顶点/边属性信息进行图匹配,并引入参数调节结构或属性的依赖程度;实验表明即使不使用属性,其解质量也优于或相当于现有最优算法,且处理时间相近。

摘要:

在现实世界图中寻找顶点到顶点的对应关系是一项具有挑战性的任务,在众多领域都有应用。基于图连通性的结构匹配已引起广泛关注,而对来自顶点和边属性的所有其他信息的整合则大多被忽视。本文提出了图属性与结构匹配(GASM)算法,该算法通过在统一框架中整合所有可用信息来提供高质量解。用于量化属性可靠性的参数可以调节解在多大程度上依赖结构或属性。我们进一步表明,即使没有属性,GASM 也能持续找到与最先进算法相当或更好的解,且处理时间相近。

英文摘要:

Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based on graphs connectivities has attracted considerable attention, while the integration of all the other information stemming from vertices and edges attributes has been mostly left aside. Here we present the Graph Attributes and Structure Matching (GASM) algorithm, which provides high-quality solutions by integrating all the available information in a unified framework. Parameters quantifying the reliability of the attributes can tune how much the solutions should rely on the structure or on the attributes. We further show that even without attributes GASM consistently finds as-good-as or better solutions than state-of-the-art algorithms, with similar processing times.

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

↑