Structural Pattern Recognition with Graph Edit Distance : Approximation Algorithms and Applications Hardback - 2016
by Kaspar Riesen
- New
- Hardback
A$196.65
A$15.26
Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Standard delivery: 7 to 12 days
Ships from Ria Christie Collections (Greater London, United Kingdom)
Details
- Title Structural Pattern Recognition with Graph Edit Distance : Approximation Algorithms and Applications
- Author Kaspar Riesen
- Binding Hardback
- Condition New
- Pages 158
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date 2016-02-08
- Illustrated Yes
- Features Illustrated
- Bookseller's Inventory # ria9783319272511_inp
- ISBN 9783319272511 / 3319272519
- Weight 0.93 lbs (0.42 kg)
- Dimensions 9.21 x 6.14 x 0.44 in (23.39 x 15.60 x 1.12 cm)
- Category Computers - General Information
- Dewey Decimal Code 005.73
- Quantity available 572
About Ria Christie Collections Greater London, United Kingdom
Biblio member since 2014
Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections
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.
Reader reviews for Structural Pattern Recognition with Graph Edit Distance : Approximation Algorithms and Applications
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
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.
