.png){kind=icon}
返回
The mutual information between graphs
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2016.07.012.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The estimation of mutual information between graphs has been an elusive problem until the formulation of graph matching in terms of manifold alignment. Then, graphs are mapped to multi-dimensional sets of points through structure preserving embeddings. Point-wise alignment algorithms can be exploited in this context to re-cast graph matching in terms of point matching. Methods based on bypass entropy estimation must be deployed to render the estimation of mutual information computationally tractable. In this paper the novel contribution is to show how manifold alignment can be combined with copula-based entropy estimators to efficiently estimate the mutual information between graphs. We compare the empirical copula with an Archimedean copula (the independent one) in terms of retrieval/recall after graph comparison. Our experiments show that mutual information built in both choices improves significantly state-of-the art divergences. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Graph entropy
Mutual information
Manifold alignment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
Image matching using alpha-entropy measures and entropic graphs使用alpha熵度量和熵图进行图像匹配.png)
SIGNAL PROCESSINGOAAI
SIGNAL PROCESSINGIF3.6
OAAI分享收藏
分享收藏A Review of Technical Impact of Electrical Vehicle Charging Stations on Distribution Grid电动汽车充电站对配电网的技术影响研究综述
PREAI
分享收藏分享收藏
查看更多内容