GOT:一个用于图比较的最优传输框架
GOT: An Optimal Transport framework for Graph comparison
摘要:
我们提出了一个新的框架的基础上最佳运输的挑战性问题比较图。具体而言,我们利用相对于图形拓扑结构定义的平滑图形信号的概率分布。这使我们能够推导出一个明确的表达的图形信号分布之间的Wasserstein距离的图形拉普拉斯矩阵。这导致了一个结构上有意义的措施比较图,这是能够考虑到图的全局结构,而大多数其他措施只是观察局部变化独立。我们的措施,然后用于制定一个新的图对齐问题,其目标是估计置换,最大限度地减少两个图之间的距离。我们进一步提出了一个有效的随机算法的基础上贝叶斯探索,以适应非凸性的图对齐问题。我们最后展示了我们的新框架在不同任务上的性能,如图对齐,图分类和图信号预测,我们表明我们的方法相对于最先进的算法有了显着的改进。
英文摘要:
We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows us to derive an explicit expression of the Wasserstein distance between graph signal distributions in terms of the graph Laplacian matrices. This leads to a structurally meaningful measure for comparing graphs, which is able to take into account the global structure of graphs, while most other measures merely observe local changes independently. Our measure is then used for formulating a new graph alignment problem, whose objective is to estimate the permutation that minimizes the distance between two graphs. We further propose an efficient stochastic algorithm based on Bayesian exploration to accommodate for the non-convexity of the graph alignment problem. We finally demonstrate the performance of our novel framework on different tasks like graph alignment, graph classification and graph signal prediction, and we show that our method leads to significant improvement with respect to the-state-of-art algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。