An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs
Yang X(杨旭)
2017
发表期刊IEEE Transactions on Neural Networks and Learning Systems
期号0页码:0
摘要
We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of equal-sized graph matching and subgraph matching, has found wide applications in many
computer vision and machine learning tasks. In this brief, WCS matching is first formulated as a combinatorial optimization problem over the set of partial permutation matrices. Then, it is approximately solved by a recently proposed combinatorial optimization framework—graduated nonconvexity and concavity procedure. Experimental comparisons on both synthetic graphs and real-world images validate its robustness against noise level, problem size, outlier number, and edge density.
其他摘要
关键词Graph Matching
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/15486
专题复杂系统管理与控制国家重点实验室_机器人理论与应用
推荐引用方式
GB/T 7714
Yang X. An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs[J]. IEEE Transactions on Neural Networks and Learning Systems,2017(0):0.
APA Yang X.(2017).An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs.IEEE Transactions on Neural Networks and Learning Systems(0),0.
MLA Yang X."An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs".IEEE Transactions on Neural Networks and Learning Systems .0(2017):0.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
An Algorithm for Fin(737KB)期刊论文作者接受稿开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yang X(杨旭)]的文章
百度学术
百度学术中相似的文章
[Yang X(杨旭)]的文章
必应学术
必应学术中相似的文章
[Yang X(杨旭)]的文章
相关权益政策
暂无数据
收藏/分享
文件名: An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。