.png){kind=icon}
返回
Message-Passing Algorithms for Sparse Network Alignment
.png){kind=icon}
OA
AI
DOI：10.1145/2435209.2435212.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Network alignment generalizes and unifies several approaches for forming a matching or alignment between the vertices of two graphs. We study a mathematical programming framework for network alignment problem and a sparse variation of it where only a small number of matches between the vertices of the two graphs are possible. We propose a new message passing algorithm that allows us to compute, very efficiently, approximate solutions to the sparse network alignment problems with graph sizes as large as hundreds of thousands of vertices. We also provide extensive simulations comparing our algorithms with two of the best solvers for network alignment problems on two synthetic matching problems, two bioinformatics problems, and three large ontology alignment problems including a multilingual problem with a known labeled alignment.
Keyword:
Algorithms
Network alignment
graph matching
belief propagation
message-passing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
.png){kind=icon}
分享收藏Global alignment of multiple protein interaction networks with application to functional orthology detection多蛋白质相互作用网络的全局比对及其在功能直系检测中的应用OAAI
OAAI分享收藏Effect of Carrier Gas on the Growth and Characteristics of Spin-Capable Multiwalled Carbon Nanotubes
PREAI
分享收藏
查看更多内容