Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications - Hardback

Springer
SKU:
9783319272511
|
ISBN13:
9783319272511
$117.22
(No reviews yet)
Usually Ships in 24hrs
Current Stock:
Estimated Delivery by: | Fastest delivery by:
Adding to cart… The item has been added
Buy ebook
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 discussedin the book.


  • | Author: Kaspar Riesen
  • | Publisher: Springer
  • | Publication Date: Feb 08, 2016
  • | Number of Pages: 158 pages
  • | Binding: Hardback or Cased Book
  • | ISBN-10: 3319272519
  • | ISBN-13: 9783319272511
Author:
Kaspar Riesen
Publisher:
Springer
Publication Date:
Feb 08, 2016
Number of pages:
158 pages
Binding:
Hardback or Cased Book
ISBN-10:
3319272519
ISBN-13:
9783319272511