Visit our Christmas Gift Finder
Click & Collect from 2 Hours*
Last Christmas delivery dates
Free UK Standard Delivery On all orders £20 and over Order in time for Christmas 19th December 2nd Class | 20th December 1st Class Free Click & Collect to UK shops From 2 hours of your order*
Bridging The Gap Between Graph Edit Distance And Kernel Machines - Series In Machine Perception And Artificial Intelligence 68 (Hardback)
  • Bridging The Gap Between Graph Edit Distance And Kernel Machines - Series In Machine Perception And Artificial Intelligence 68 (Hardback)
zoom

Bridging The Gap Between Graph Edit Distance And Kernel Machines - Series In Machine Perception And Artificial Intelligence 68 (Hardback)

(author), (author)
£86.00
Hardback 244 Pages / Published: 04/09/2007
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: World Scientific Publishing Co Pte Ltd
ISBN: 9789812708175
Number of pages: 244
Weight: 572 g
Dimensions: 229 x 163 x 23 mm

You may also be interested in...

Generic Inference
Added to basket
£100.00
Hardback
An Introduction to Genetic Algorithms
Added to basket
Superintelligence
Added to basket
£18.99
Hardback
Machine Learning
Added to basket
£37.99
Paperback
Understanding Machine Learning
Added to basket
Understanding Beliefs
Added to basket
Bayesian Reasoning and Machine Learning
Added to basket
Machine Learning for Hackers
Added to basket
Machine Learning
Added to basket
Emotion: A Very Short Introduction
Added to basket
The Elements of Statistical Learning
Added to basket
Thoughtful Machine Learning
Added to basket
The Quest for Artificial Intelligence
Added to basket

Please sign in to write a review

Your review has been submitted successfully.