On the impact of using utilities rather than costs for graph matching
Loading...
Author (Corporation)
Publication date
09.11.2019
Typ of student thesis
Course of study
Collections
Type
01A - Journal article
Editors
Editor (Corporation)
Supervisor
Parent work
Neural Processing Letters
Special issue
DOI of the original publication
Link
Series
Series number
Volume
48
Issue / Number
Pages / Duration
691-707
Patent number
Publisher / Publishing institution
Springer
Place of publication / Event location
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
The concept of graph edit distance constitutes one of the most flexible graph matching paradigms available. The major drawback of graph edit distance, viz. the exponential time complexity, has been recently overcome by means of a reformulation of the edit distance problem to a linear sum assignment problem. However, the substantial speed up of the matching is also accompanied by an approximation error on the distances. Major contribution of this paper is the introduction of a transformation process in order to convert the underlying cost model into a utility model. The benefit of this transformation is that it enables the integration of additional information in the assignment process.We empirically confirm the positive effects of this transformation on five benchmark graph sets with respect to the accuracy and run time of a distance based classifier.
Keywords
Subject (DDC)
Event
Exhibition start date
Exhibition end date
Conference start date
Conference end date
Date of the last check
ISBN
ISSN
1573-773X
1370-4621
1370-4621
Language
English
Created during FHNW affiliation
Yes
Strategic action fields FHNW
Publication status
Published
Review
Peer review of the complete publication
Open access category
Closed
License
Citation
Riesen, K., Bunke, H., & Fischer, A. (2019). On the impact of using utilities rather than costs for graph matching. Neural Processing Letters, 48, 691–707. https://doi.org/10.1007/s11063-017-9739-7