This unique text/reference presents a thorough introduction to the field of structural pattern recognition, with a particular focus on graph edit distance (GED). illustrates how the quadratic assignment problem of GED can be reduced to a linear sum assignment problem;

Part I: Foundations and Applications of Graph Edit Distance.- Introduction and Basic Concepts.- Graph Edit Distance.- Bipartite Graph Edit Distance.- Part II: Recent Developments and Research on Graph Edit Distance.- Improving the Distance Accuracy of Bipartite Graph Edit Distance.- Learning Exact Graph Edit Distance.- Speeding Up Bipartite Graph Edit Distance.- Conclusions and Future Work.- Appendix A: Experimental Evaluation of Sorted Beam Search.- Appendix B: Data Sets.

This unique text/reference presents a thorough introduction to the field of structural pattern recognition, with a particular focus on graph edit distance (GED), one of the most flexible graph distance models available. 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 paradigmDescribes a reformulation of GED to a quadratic assignment problemIllustrates how the quadratic assignment problem of GED can be reduced to a linear sum assignment problemReviews strategies for reducing both the overestimation of the true edit distance and the matching time in the approximation frameworkExamines the improvement demonstrated by the described algorithmic framework with respect to the distance accuracy and the matching timeIncludes appendices listing the datasets employed for the experimental evaluations discussed in the book Researchers and graduate students interested in the field of structural pattern recognition will find this focused work to be an essential reference on the latest developments in GED. Dr. Kaspar Riesen is a university lecturer of computer science in the Institute for Information Systems at the University of Applied Sciences and Arts Northwestern Switzerland, Olten, Switzerland.

“The book presents the use of graphs in the field of structural pattern recognition. … The book is written in a very accessible fashion. The author gives many examples presenting the notations and problems considered. The book is suitable for graduate students and is an ideal reference for researchers and professionals interested in graph edit distance and its applications in pattern recognition.” (Krzystof Gdawiec, zbMATH 1365.68004, 2017) “This book is exactly about this fascinating topic: the definition, the study of properties, and the areas of application of the graph edit distance in the realm of structural pattern recognition. … The book’s intended audience is advanced graduate students in science and engineering, but also professionals working in relevant fields.” (Dimitrios Katsaros, Computing Reviews, computingreviews.com, August, 2016)

Provides a thorough introduction to the concept of graph edit distance (GED) Describes a selection of diverse GED algorithms with step-by-step examples Presents a unique overview of recent pattern recognition applications based on GED Includes several novel and significant extensions of GED, with a special focus on fast approximation algorithms for GED Includes supplementary material: sn.pub/extras

GPSR Compliance The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this. If you have any concerns about our products you can contact us on ProductSafety@springernature.com. In case Publisher is established outside the EU, the EU authorized representative is: Springer Nature Customer Service Center GmbH Europaplatz 3 69115 Heidelberg, Germany ProductSafety@springernature.com