• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Statistics and computing >Graph matching beyond perfectly-overlapping Erdos-Renyi random graphs
【24h】

Graph matching beyond perfectly-overlapping Erdos-Renyi random graphs

机译：Graph matching beyond perfectly-overlapping Erdos-Renyi random graphs

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

Graph matching is a fruitful area in terms of both algorithms and theories. Given two graphs G(1) = (V-1, E-1) and G(2) = (V-2, E-2), where V-1 and V-2 are the same or largely overlapped upon an unknown permutation pi*, graph matching is to seek the correct mapping pi*. In this paper, we exploit the degree information, whichwas previously used only in noiseless graphs and perfectly-overlapping Erdos-Renyi random graphs matching. We are concerned with graph matching of partially-overlapping graphs and stochastic block models, which are more useful in tackling real-life problems. We propose the edge exploited degree profile graph matching method and two refined variations. We conduct a thorough analysis of our proposed methods' performances in a range of challenging scenarios, including coauthorship data set and a zebrafish neuron activity data set. Our methods are proved to be numerically superior than the state-of-the-art methods. The algorithms are implemented in the R (A language and environment for statistical computing, R Foundation for Statistical Computing, Vienna, 2020) package GMPro (GMPro: graph matching with degree profiles, 2020).

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号