.png){kind=icon}
返回
Seeded graph matching
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2018.09.014.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given two graphs, the graph matching problem is to align the two vertex sets so as to minimize the number of adjacency disagreements between the two graphs. The seeded graph matching problem is the graph matching problem when we are first given a partial alignment that we are tasked with completing. In this article, we modify the state-of-the-art approximate graph matching algorithm FAQ of Vogelstein et al. (2015) to make it a fast approximate seeded graph matching algorithm, adapt its applicability to include graphs with differently sized vertex sets, and extend the algorithm so as to provide, for each individual vertex, a nomination list of likely matches. We demonstrate the effectiveness of our algorithm via simulation and real data experiments; indeed, knowledge of even a few seeds can be extremely effective when our seeded graph matching algorithm is used to recover a naturally existing alignment that is only partially observed. (C) 2018 The Authors. Published by Elsevier Ltd.
Keyword:
Hungarian algorithm
Quadratic assignment problem (QAP)
Vertex alignment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Stability of Reference Genes for Messenger RNA Quantification by Real-Time PCR in Mouse Dextran Sodium Sulfate Experimental Colitis.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏Global alignment of multiple protein interaction networks with application to functional orthology detection多蛋白质相互作用网络的全局比对及其在功能直系检测中的应用OAAI
OAAI分享收藏Prediction study on karst water bursting of urban tail tansit engineering in covered karst region
PREAI
分享收藏
查看更多内容