Bridging The Gap Between Graph Edit Distance And Kernel Machines / Najlacnejšie knihy
Bridging The Gap Between Graph Edit Distance And Kernel Machines

Kód: 05068828

Bridging The Gap Between Graph Edit Distance And Kernel Machines

Autor Michel Neuhaus, Horst Bunke

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 meth ... celý popis

127.51


Očakávaný dotlač
Termín neznámy

Informovať o naskladnení

Pridať medzi želanie

Mohlo by sa vám tiež páčiť

Darujte túto knihu ešte dnes
  1. Objednajte knihu a vyberte Zaslať ako darček.
  2. Obratom obdržíte darovací poukaz na knihu, ktorý môžete ihneď odovzdať obdarovanému.
  3. Knihu zašleme na adresu obdarovaného, o nič sa nestaráte.

Viac informácií

Informovať o naskladnení knihy

Informovať o naskladnení knihy


Súhlas - Odoslaním žiadosti vyjadrujem Súhlas so spracovaním osobných údajov na marketingové účely.

Zašleme vám správu akonáhle knihu naskladníme

Zadajte do formulára e-mailovú adresu a akonáhle knihu naskladníme, zašleme vám o tom správu. Postrážime všetko za vás.

Viac informácií o knihe Bridging The Gap Between Graph Edit Distance And Kernel Machines

Nákupom získate 316 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Artificial intelligence

127.51

Obľúbené z iného súdka



Osobný odber Bratislava a 2642 dalších

Copyright ©2008-24 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies


Môj účet: Prihlásiť sa
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupný košík ( prázdny )

Vyzdvihnutie v Zásielkovni
zadarmo nad 59,99 €.

Nachádzate sa: