arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.3813stat.MLstat.APstat.ME
收藏

基于保真度和可公度联合优化的种子图匹配

Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability

Heather Patsolic, Sancar Adali, Joshua T. Vogelstein, Youngser Park, Carey E. Friebe, Gongkai Li, Vince Lyzinski

摘要:

我们提出了一种新的近似图匹配算法,将种子数据的图匹配范例。我们的保真度和可公度联合优化(JOFC)算法将两个图嵌入到一个共同的欧氏空间中,在那里可以执行匹配推理任务。通过真实和模拟数据的例子,我们证明了我们的算法在匹配图与各种特性的多功能性-加权,定向,循环,多对一和多对多的匹配,和软SESEQUENCE。

英文摘要:

We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOFC) algorithm embeds two graphs into a common Euclidean space where the matching inference task can be performed. Through real and simulated data examples, we demonstrate the versatility of our algorithm in matching graphs with various characteristics--weightedness, directedness, loopiness, many-to-one and many-to-many matchings, and soft seedings.

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

↑