Automatic learning of cost functions for graph edit distance-Reference-Cited by-同舟云学术

Automatic learning of cost functions for graph edit distance

Published:2007-01 Issue:1 Volume:177 Page:239-247
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Neuhaus Michel,Bunke Horst

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference27 articles.

1. Special Section on Graph algorithms and computer vision, IEEE Transactions on Pattern Analysis and Machine Intelligence 23 (10) (2001) 1040–1151.

2. Special Issue on graph based representations, Pattern Recognition Letters 24 (8) (2003) 1033–1122.

3. Special Issue on Graph matching in pattern recognition and computer vision, International Journal of Pattern Recognition and Artificial Intelligence 18 (3) (2004) 261–517.

4. Inexact graph matching for structural pattern recognition;Bunke;Pattern Recognition Letters,1983

5. A graph distance metric based on the maximal common subgraph;Bunke;Pattern Recognition Letters,1998

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

1. Travel-Activity Patterns Identification Using Graph Edit Distance;2023 IEEE 26th International Conference on Intelligent Transportation Systems (ITSC);2023-09-24

2. Graphs in pattern recognition: successes, shortcomings, and perspectives;Journal of Electronic Imaging;2023-03-23

3. A Study on the Stability of Graph Edit Distance Heuristics;Electronics;2022-10-14

4. A New String Edit Distance and Applications;Algorithms;2022-07-12

5. Learning Distances Between Graph Nodes and Edges;Lecture Notes in Computer Science;2022