Bridging The Gap Between Graph Edit Distance And Kernel Machines
Regular price
€98.99
14 days return policy
Shipping & Delivery
A01=Horst Bunke
A01=Michel Neuhaus
Author_Horst Bunke
Author_Michel Neuhaus
Category=UYQP
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Error-Tolerant Graph Matching
Graph Edit Distance
Graph Kernels
Kernel Machines
Structural Pattern Recognition
Product details
- ISBN 9789812708175
- Publication Date: 04 Sep 2007
- Publisher: World Scientific Publishing Co Pte Ltd
- Publication City/Country: SG
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
In graph-based structural pattern recognition, the idea is to transform patterns into graphs and perform the analysis and recognition of patterns in the graph domain — commonly referred to as graph matching. A large number of methods for graph matching have been proposed. Graph edit distance, for instance, defines the dissimilarity of two graphs by the amount of distortion that is needed to transform one graph into the other and is considered one of the most flexible methods for error-tolerant graph matching.This book focuses on graph kernel functions that are highly tolerant towards structural errors. The basic idea is to incorporate concepts from graph edit distance into kernel functions, thus combining the flexibility of edit distance-based graph matching with the power of kernel machines for pattern recognition. The authors introduce a collection of novel graph kernels related to edit distance, including diffusion kernels, convolution kernels, and random walk kernels. From an experimental evaluation of a semi-artificial line drawing data set and four real-world data sets consisting of pictures, microscopic images, fingerprints, and molecules, the authors demonstrate that some of the kernel functions in conjunction with support vector machines significantly outperform traditional edit distance-based nearest-neighbor classifiers, both in terms of classification accuracy and running time.
