๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

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

โœ Scribed by Kaspar Riesen


Publisher
Springer
Year
2016
Tongue
English
Leaves
158
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 discussed in the book.


๐Ÿ“œ SIMILAR VOLUMES


Structural Pattern Recognition with Grap
โœ Kaspar Riesen (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2015 ๐Ÿ› Springer International Publishing ๐ŸŒ English

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

Hypercube Algorithms: with Applications
โœ Prof. Sanjay Ranka, Prof. Sartaj Sahni (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 1990 ๐Ÿ› Springer-Verlag New York ๐ŸŒ English

<p>Fundamentals algorithms for SIMD and MIMD hypercubes are developed. These include algorithms for such problems as data broadcasting, data sum, prefix sum, shift, data circulation, data accumulation, sorting, random access reads and writes and data permutation. The fundamental algorithms are then

Python Data Structures and Algorithms: I
โœ Baka, Benjamin;Julian, David ๐Ÿ“‚ Library ๐Ÿ“… 2017 ๐Ÿ› Packt Publishing, Limited ๐ŸŒ English

Implement classic and functional data structures and algorithms using PythonAbout This Book* A step by step guide, which will provide you with a thorough discussion on the analysis and design of fundamental Python data structures.* Get a better understanding of advanced Python concepts such as big-o

Graph Theory with Algorithms and its App
โœ Santanu Saha Ray ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Springer ๐ŸŒ English

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers

Graph Theory with Algorithms and its App
โœ Santanu Saha Ray (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2013 ๐Ÿ› Springer India ๐ŸŒ English

<p>The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to reade