menu
{ "item_title" : "Structural Pattern Recognition with Graph Edit Distance", "item_author" : [" Kaspar Riesen "], "item_description" : "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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/31/927/251/3319272519_b.jpg", "price_data" : { "retail_price" : "109.99", "online_price" : "109.99", "our_price" : "109.99", "club_price" : "109.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Structural Pattern Recognition with Graph Edit Distance|Kaspar Riesen

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

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783319272511
  • ISBN-10: 3319272519
  • Publisher: Springer
  • Publish Date: February 2016
  • Dimensions: 9.21 x 6.14 x 0.44 inches
  • Shipping Weight: 0.93 pounds
  • Page Count: 158

Related Categories

You May Also Like...

    1

BAM Customer Reviews