Bridging the Gap Between Graph Edit Distance and Kernel Machines

Bridging the Gap Between Graph Edit Distance and Kernel Machines

Versandkostenfrei!
Versandfertig in über 4 Wochen
95,99 €
inkl. MwSt.
PAYBACK Punkte
48 °P sammeln!
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 structur...