.png){kind=icon}
返回
Hypergraph Matching With an Entropy Barrier Function
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2895809.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph matching problem has been widely used in many fields. Due to the discrete property of graph matching problem, the continuous relaxation will result in a bad influence on the solution. Thus, we propose a hypergraph matching model with an entropy barrier function considering the discrete property of the assignment matrix. The model is solved by a nonmonotone active set projected Newton method whose nonmonotone line search technique has a good ability to accept the projected Newton stepsize. We evaluate our method through several experiments, which indicates that our method has better matching results than others.
Keyword:
Hypergraph matching
nonmonotone line search
quadratic penalty method
tensor technique
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Triangular Alignment (TAME): A Tensor-Based Approach for Higher-Order Network Alignment三角对齐 (TAME): 基于张量的高阶网络对齐方法OAAI
.png){kind=icon}
OAAI分享收藏
查看更多内容