Bridging the gap between graph edit distance and kernel machines /

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Neuhaus, Michel
Otros Autores: Bunke, Horst
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Singapore ; Hackensack, NJ : World Scientific Pub., ©2007.
Colección:Series in machine perception and artificial intelligence ; v. 68.
Temas:
Pattern recognition systems.
Kernel functions.
Matching theory.
Machine learning.
Graph theory.
Pattern Recognition, Automated
Machine Learning
Reconnaissance des formes (Informatique)
Noyaux (Mathématiques)
Théorie du couplage.
Apprentissage automatique.
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
Acceso en línea:Texto completo
Tabla de Contenidos:
  • 1. Introduction
  • 2. Graph matching
  • 3. Graph edit distance
  • 4. Kernel machines
  • 5. Graph kernels
  • 6. Experimental results
  • 7. Conclusions.

Ejemplares similares