Image of Structural Pattern Recognition with Graph Edit Distance
Bookmark Share

Text

Structural Pattern Recognition with Graph Edit Distance

This unique text/reference presents a thorough introduction to the field of structural pattern recognition, with a particular focus on graph edit distance (GED). The book also provides a detailed review of a diverse selection of novel methods related to GED, and concludes by suggesting possible avenues for future research. Topics and features: formally introduces the concept of GED, and highlights the basic properties of this graph matching paradigm; describes a reformulation of GED to a quadratic assignment problem; illustrates how the quadratic assignment problem of GED can be reduced to a linear sum assignment problem; reviews strategies for reducing both the overestimation of the true edit distance and the matching time in the approximation framework; examines the improvement demonstrated by the described algorithmic framework with respect to the distance accuracy and the matching time; includes appendices listing the datasets employed for the experimental evaluations discussed in the book.

Availability

No copy data

Detail Information
Series Title
-
Call Number
-
Publisher
Cham : Springer.,
Collation
-
Language
English
ISBN/ISSN
978-3-319-27252-8
Classification
NONE
Content Type
-
Media Type
-
Carrier Type
-
Edition
-
Subject(s)
Computer Science
Specific Detail Info
-
Statement of Responsibility
Other Information
Cataloger
Jemadi
Source
https://link.springer.com/content/pdf/10.1007/978-3-319-27252-8.pdf?pdf=button
Validator
-
Other version/related

No other version available

File Attachment
Comments
You must be logged in to post a comment