Structural pattern recognition with graph edit distance. Approximation algorithms and applications
type: Item
instance of: scholarly article
title: Structural pattern recognition with graph edit distance. Approximation algorithms and applications
zbMATH Open document ID: 1365.68004
DOI: 10.1007/978-3-319-27252-8
author: Kaspar Riesen
published in: Advances in Computer Vision and Pattern Recognition
publication date: 2017-03-29T00:00:00Z
review text: The use of pattern recognition and classification is fundamental to many automated electronic systems in use today. Its applications range from military defence to medical diagnosis, from biometrics to machine learning, from bioinformatics to home entertainment, and more. Because of such diversity of applications various approaches to the problem of pattern recognition arose. One of the approaches is structural pattern recognition. The book presents the use of graphs in the field of structural pattern recognition. The author focuses on the graph edit distance, and sets two objectives in the book. The first objective is that the book should give a general and thorough introduction to the field of structural pattern recognition with a particular focus on graph edit distance. And the second objective is that it should present a comprehensive compilation of diverse novel methods related to graph edit distance that have been developed and investigated in the course of recent research. Both objectives are achieved in the book. In Chapter 1 -- which opens the first part of the book -- the author firstly introduces pattern recognition as a computer science discipline and outlines the major differences between statistical and structural pattern recognition. Next, graph-based pattern representation is formally introduced and complemented by a list of applications where graphs are employed. The rest of the chapter is devoted to formal introductions of diverse graph matching definitions and a brief survey of existing graph matching methodologies. Chapter 2 gives a formal definition of graph edit distance and introduces some basic properties of this distance model. Moreover, it presents an overview of how the cost model can be chosen in a certain graph edit distance application. Then, the exact computation of graph edit distance based on a tree search algorithm is outlined. The chapter ends with a brief review of three general approaches to graph edit distance-based pattern reco…
Mathematics Subject Classification ID: 68-02
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6698037
zbMATH Keywords: pattern recognition
zbMATH Keywords: graph edit distance
reviewed by: Krzysztof Gdawiec
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/978-3-319-27252-8
OpenAlex ID: W2506039404
description: scientific article; zbMATH DE number 6698037