Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications (Advances in Computer Vision and Pattern Recognition)

Riesen, Kaspar

ISBN 10: 3319272519 ISBN 13: 9783319272511

Editorial: Springer, 2016

Nuevos Encuadernaci�n de tapa dura

Librer�a: Ria Christie Collections, Uxbridge, Reino Unido Calificaci�n del vendedor: 5 de 5 estrellas

Vendedor de AbeBooks desde 25 de marzo de 2015

Este art�culo en concreto ya no est� disponible.

Ver los art�culos de este vendedor Crear una petici�n para art�culos similares

Ver todos los ejemplares de este libro

Descripci�n

In. N� de ref. del art�culo ria9783319272511_new

Denunciar este art�culo

Sinopsis:

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.

Acerca del autor:

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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Detalles bibliogr�ficos

T�tulo: Structural Pattern Recognition with Graph ...
Editorial: Springer
A�o de publicaci�n: 2016
Encuadernaci�n: Encuadernaci�n de tapa dura
Condici�n: New

Los mejores resultados en AbeBooks

Imagen de archivo

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

Riesen, Kaspar

Publicado por Palgrave Macmillan, 2016

ISBN 10: 3319272519 ISBN 13: 9783319272511

Antiguo o usado Tapa dura

Librería: Buchpark, Trebbin, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: B�cher | 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. N� de ref. del art�culo: 26240946/12

Contactar al vendedor

Comprar usado

EUR 74,31

EUR 105,00 shipping
Se env�a de Alemania a Estados Unidos de America

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

Structural Pattern Recognition with Graph Edit Distance

Kaspar Riesen

Publicado por Springer International Publishing, 2016

ISBN 10: 3319272519 ISBN 13: 9783319272511

Nuevo Tapa dura

Impresi�n bajo demanda

Librería: moluna, Greven, Alemania

Calificaci�n del vendedor: 4 de 5 estrellas

Gebunden. Condici�n: 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. N� de ref. del art�culo: 83966744

Contactar al vendedor

Comprar nuevo

EUR 92,27

EUR 48,99 shipping
Se env�a de Alemania a Estados Unidos de America

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

M�s im�genes

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

Kaspar Riesen

Publicado por Springer, 2016

ISBN 10: 3319272519 ISBN 13: 9783319272511

Nuevo Tapa dura

Impresi�n bajo demanda

Librería: preigu, Osnabr�ck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Contactar al vendedor

Comprar nuevo

EUR 95,80

EUR 70,00 shipping
Se env�a de Alemania a Estados Unidos de America

Cantidad disponible: 5 disponibles

A�adir al carrito

Imagen de archivo

Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications (Advances in Computer Vision and Pattern Recognition)

Riesen, Kaspar

Publicado por Springer, 2016

ISBN 10: 3319272519 ISBN 13: 9783319272511

Nuevo Tapa dura

Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. N� de ref. del art�culo: ABLIING23Mar3113020092235

Contactar al vendedor

Comprar nuevo

EUR 102,36

EUR 3,41 shipping
Se env�a dentro de Estados Unidos de America

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Structural Pattern Recognition with Graph Edit Distance

Kaspar Riesen

Publicado por Springer International Publishing, Springer International Publishing Feb 2016, 2016

ISBN 10: 3319272519 ISBN 13: 9783319272511

Nuevo Tapa dura

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Buch. Condici�n: Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 172 pp. Englisch. N� de ref. del art�culo: 9783319272511

Contactar al vendedor

Comprar nuevo

EUR 106,99

EUR 60,00 shipping
Se env�a de Alemania a Estados Unidos de America

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

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

Kaspar Riesen

Publicado por Springer International Publishing, 2016

ISBN 10: 3319272519 ISBN 13: 9783319272511

Nuevo Tapa dura

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Buch. Condici�n: 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 discussed in the book. N� de ref. del art�culo: 9783319272511

Contactar al vendedor

Comprar nuevo

EUR 106,99

EUR 62,15 shipping
Se env�a de Alemania a Estados Unidos de America

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

Structural Pattern Recognition with Graph Edit Distance

Kaspar Riesen

Publicado por Springer International Publishing Feb 2016, 2016

ISBN 10: 3319272519 ISBN 13: 9783319272511

Nuevo Tapa dura

Impresi�n bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Buch. Condici�n: 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. N� de ref. del art�culo: 9783319272511

Contactar al vendedor