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

基于部分最优传输的子图匹配

Subgraph Matching via Partial Optimal Transport

Wen-Xin Pan, Isabel Haasler, Pascal Frossard

AI总结:

本文提出基于部分融合Gromov-Wasserstein距离的子图匹配方法,结合子图滑动策略提升大规模图上的效率,在合成与真实数据集上优于现有方法,并对噪声具有鲁棒性。

摘要:

在这项工作中,我们提出了一种新的子图匹配方法,即在大规模源图中寻找给定查询图的问题,该方法基于融合的Gromov-Wasserstein距离。我们将子图匹配问题形式化为一个部分融合Gromov-Wasserstein问题,这使我们能够借助现有理论和计算方法来解决这一具有挑战性的问题。我们通过采用子图滑动方法来扩展我们的方法,使其即使对于大规模图也能高效运行。在数值实验中,我们展示了我们的新算法在合成数据集和真实世界数据集上均具有超越最先进子图匹配方法的能力。特别是,我们的方法对数据集中的噪声表现出鲁棒性,并实现了非常快的查询时间。

英文摘要:

In this work, we propose a novel approach for subgraph matching, the problem of finding a given query graph in a large source graph, based on the fused Gromov-Wasserstein distance. We formulate the subgraph matching problem as a partial fused Gromov-Wasserstein problem, which allows us to build on existing theory and computational methods in order to solve this challenging problem. We extend our method by employing a subgraph sliding approach, which makes it efficient even for large graphs. In numerical experiments, we showcase that our new algorithms have the ability to outperform state-of-the-art methods for subgraph matching on synthetic as well as realworld datasets. In particular, our methods exhibit robustness with respect to noise in the datasets and achieve very fast query times.

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

↑