Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications
- Length: 158 pages
- Edition: 1st ed. 2015
- Language: English
- Publisher: Springer
- Publication Date: 2016-02-10
- ISBN-10: 3319272519
- ISBN-13: 9783319272511
- Sales Rank: #9539549 (See Top 100 Books)
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.
Table of Contents
Part I Foundations and Applicationsof Graph Edit Distance
Chapter 1 Introduction and Basic Concepts
Chapter 2 Graph Edit Distance
Chapter 3 Bipartite Graph Edit Distance
Part II Recent Developments and Researchon Graph Edit Distance
Chapter 4 Improving the Distance Accuracy of Bipartite Graph Edit Distance
Chapter 5 Learning Exact Graph Edit Distance
Chapter 6 Speeding Up Bipartite Graph Edit Distance
Chapter 7 Conclusions and Future Work
Appendix A: Experimental Evaluation of Sorted Beam Search
Appendix B: Data Sets
Donate to keep this site alive
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.