Structural Pattern Recognition With Graph Edit Distance Approximation Algorithms

This Unique Textreference 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.