Structural Pattern Recognition with Graph Edit Distance

Approximation Algorithms and Applications

Nonfiction, Computers, Advanced Computing, Engineering, Computer Vision, Programming, Data Modeling & Design, General Computing
Cover of the book Structural Pattern Recognition with Graph Edit Distance by Kaspar Riesen, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Kaspar Riesen ISBN: 9783319272528
Publisher: Springer International Publishing Publication: January 9, 2016
Imprint: Springer Language: English
Author: Kaspar Riesen
ISBN: 9783319272528
Publisher: Springer International Publishing
Publication: January 9, 2016
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book Advances in Design for Inclusion by Kaspar Riesen
Cover of the book Astronomy at High Angular Resolution by Kaspar Riesen
Cover of the book Maxillofacial Cone Beam Computed Tomography by Kaspar Riesen
Cover of the book MBA by Kaspar Riesen
Cover of the book Automated Deduction - CADE-25 by Kaspar Riesen
Cover of the book Nicaragua Before the International Court of Justice by Kaspar Riesen
Cover of the book Fundamentals of Friction and Wear on the Nanoscale by Kaspar Riesen
Cover of the book Quantum Theory and Free Will by Kaspar Riesen
Cover of the book Big Data Analytics by Kaspar Riesen
Cover of the book Food Hygiene and Applied Food Microbiology in an Anthropological Cross Cultural Perspective by Kaspar Riesen
Cover of the book Transition Curves for Highway Geometric Design by Kaspar Riesen
Cover of the book Arabic Science Fiction by Kaspar Riesen
Cover of the book Relativity without Spacetime by Kaspar Riesen
Cover of the book TIM PEAKE and BRITAIN'S ROAD TO SPACE by Kaspar Riesen
Cover of the book Canine and Feline Skin Cytology by Kaspar Riesen
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy