BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

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

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

Structural Pattern Recognition with Graph Edit Distance: Approximation
Stock photo: cover may vary

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

by Riesen, Kaspar (Author)

Add to wish list
  • New
  • Hardback
New

Description

Springer, 2016. Hardcover. New. 174 pages. 9.25x6.25x0.50 inches.
Ask the seller a question Add to wish list
A$248.14
A$28.66 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Revaluation Books (Devon, United Kingdom)

Details

About Revaluation Books Devon, United Kingdom

Biblio member since 2020

General bookseller of both fiction and non-fiction.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Revaluation Books

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

From the publisher

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.

From the rear cover

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 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

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.

About the author

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.

tracking-