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 ...
Read More
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.
Read Less
Add this copy of Bridging the Gap Between Graph Edit Distance and Kernel to cart. $82.00, very good condition, Sold by Second Story Books rated 4.0 out of 5 stars, ships from Rockville, MD, UNITED STATES, published 2007 by World Scientific Publishing.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Book. Octavo, 232 pages. In Very Good condition. Bound in publisher's multicolored paper boards. Spine white, green, black, and orange with orange and black lettering. Mild rubbing to edges and corners of boards. Light scuffing to boards. Textblock clean. NOTE: Shelved in Netdesk office, Case #2. 1377204. FP New Rockville Stock.
Add this copy of Bridging the Gap Between Graph Edit Distance and Kernel to cart. $93.68, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 2007 by World Scientific Publishing Company.
Add this copy of Bridging the Gap Between Graph Edit Distance and Kernel to cart. $113.02, new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 2007 by World Scientific Publishing Company, Incorporated.
Add this copy of Bridging the Gap Between Graph Edit Distance and Kernel to cart. $127.80, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2007 by World Scientific Publishing Co.
Add this copy of Bridging the Gap Between Graph Edit Distance and Kernel to cart. $166.15, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2007 by World Scientific Publishing Co.
