A novel hierarchical-based framework for upper bound computation of graph edit distance-Reference-Cited by-同舟云学术

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

A novel hierarchical-based framework for upper bound computation of graph edit distance

Published:2018-08 Issue: Volume:80 Page:210-224
ISSN:0031-3203
Container-title:Pattern Recognition
language:en
Short-container-title:Pattern Recognition

Author:

Gouda Karam,Arafa Mona,Calders Toon

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Signal Processing,Software

Reference32 articles.

1. Thirty years of graph matching in pattern recognition;Conte;Int. J. Pattern Recognit. Artif. Intell.,2004

2. NeMa: fast graph search with label similarity;Khan,2013

3. Complete and accurate clone detection in graph-based models;Pham,2009

4. Protein function prediction via graph kernels;Borgwardt;Bioinformatics,2005

5. Similarity flooding: a versatile graph matching algorithm and its application to schema matching;Melnik,2002

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

1. A Graph Matching Approach by Aggregated Search;2023 9th International Conference on Control, Decision and Information Technologies (CoDIT);2023-07-03

2. An Approximation Method for Large Graph Similarity;2020 IEEE International Conference on Big Data (Big Data);2020-12-10

3. Fast Similarity Search for Graphs by Edit Distance;Cybernetics and Systems Analysis;2019-11

4. A novel edge-centric approach for graph edit similarity computation;Information Systems;2019-02

5. An efficient algorithm for graph edit distance computation;Knowledge-Based Systems;2019-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP