Bridging the gap between graph edit distance and kernel machines

Bridging the gap between graph edit distance and kernel machines / 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 methods for graph matching have been proposed. Graph edit distance, for in...

Full description

Saved in:
Bibliographic Details
Main Author: Neuhaus, Michel
Other Authors: Bunke, Horst
Format: eBook
Language:English
Published: Singapore ; Hackensack, NJ : World Scientific Pub., ©2007.
Series:Series in machine perception and artificial intelligence ; v. 68.
Subjects:
Pattern recognition systems.
Kernel functions.
Matching theory.
Machine learning.
Graph theory.
SCIENCE > System Theory.
TECHNOLOGY & ENGINEERING > Operations Research.
COMPUTERS > General.
Graph theory
Kernel functions
Machine learning
Matching theory
Pattern recognition systems
Kerndarstellung
Maschinelles Lernen
Künstliche Intelligenz
Musteranalyse
Mustererkennung
Online Access:Click for online access
Table of Contents:
  • 1. Introduction
  • 2. Graph matching
  • 3. Graph edit distance
  • 4. Kernel machines
  • 5. Graph kernels
  • 6. Experimental results
  • 7. Conclusions.

Similar Items