On the Impact of Using Utilities Rather than Costs for Graph Matching-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the Impact of Using Utilities Rather than Costs for Graph Matching

Published:2017-11-09 Issue:2 Volume:48 Page:691-707
ISSN:1370-4621
Container-title:Neural Processing Letters
language:en
Short-container-title:Neural Process Lett

Author:

Riesen Kaspar,Fischer Andreas,Bunke Horst

Funder

Hasler Stiftung

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computer Networks and Communications,General Neuroscience,Software

Link

http://link.springer.com/article/10.1007/s11063-017-9739-7/fulltext.html

Reference58 articles.

1. Achatz H, Kleinschmidt P, Paparrizos K (1991) Applied geometry and discrete mathematics, chap. A dual forest algorithm for the assignment problem. AMS 1–11 (1991)

2. Ahuja R, Orlin J (1992) The scaling network simplex algorithm. Oper Res 40(1):5–13

3. Ambauen R, Fischer S, Bunke H (2003) Graph edit distance with node splitting and merging and its application to diatom identification. In: Hancock E, Vento M (eds) Proceedings of 4th International workshop on graph based representations in pattern recognition, LNCS 2726. Springer, pp 95–106

4. Avis D (1983) A survey of heuristics for the weighted matching problem. Networks 13:475–493

5. Berretti S, Del Bimbo A, Vicario E (2001) Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans Pattern Anal Mach Intell 23(10):1089–1105

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Relation-based multi-type aware knowledge graph embedding;Neurocomputing;2021-10

2. Group of components detection in engineering drawings based on graph matching;Engineering Applications of Artificial Intelligence;2021-09

3. Using Geometric Graph Matching in Image Registration;Proceedings of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications;2021

4. A general model to define the substitution, insertion and deletion graph edit costs based on an embedded space;Pattern Recognition Letters;2020-10

5. Learning the Graph Edit Costs Based on a Learning Model Applied to Sub-optimal Graph Matching;Neural Processing Letters;2019-09-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3