ISBN: 9783319801018 - structural pattern recognition with graph edit distance: approximation algorithms and applications (13 risultati)

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. In English.

Condizione: New. pp. 174.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Taschenbuch. Condizione: Neu. Structural Pattern Recognition with Graph Edit Distance | Approximation Algorithms and Applications | Kaspar Riesen | Taschenbuch | Advances in Computer Vision and Pattern Recognition | xiii | Englisch | 2018 | Springer | EAN 9783319801018 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Paperback. Condizione: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 172 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides a thorough introduction to the concept of graph edit distance (GED) Describes a selection of diverse GED algorithms with step-by-step examples Presents a unique overview of recent pattern recognition applications based on GED.…

Condizione: New. Print on Demand pp. 174.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 172 pp. Englisch.…

Condizione: New. PRINT ON DEMAND pp. 174.