Edit distance-based kernel functions for structural pattern classification

DOI10.1016/j.patcog.2006.04.012zbMath1096.68140MaRDI QIDQ2498678

Michel Neuhaus, Horst Bunke

Publication date: 16 August 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.04.012

zbMATH Keywords

kernel methods; string matching; graph matching; support vector machine; edit distance

Mathematics Subject Classification ID

68T10: Pattern recognition, speech recognition

Related Items

Indefinite Proximity Learning: A Review, Shape classification by manifold learning in multiple observation spaces, A theory of subtree matching and tree kernels based on the edit distance concept, Learning state machine-based string edit kernels, Dissimilarity between two skeletal trees in a context, A quantum Jensen-Shannon graph kernel for unattributed graphs, The journey of graph kernels through two decades, Convex graph invariant relaxations for graph edit distance, Measuring linearity of connected configurations of a finite number of 2D and 3D curves, Topographic Mapping of Large Dissimilarity Data Sets

Uses Software

• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the derivation of maximal common subgraphs of two directed or undirected graphs
• Backtrack search algorithms and the maximal common subgraph problem
• A fast algorithm for computing longest common subsequences
• The String-to-String Correction Problem
• Computing approximate tree edit distance using relaxation labeling
• Handbook of Fingerprint Recognition
• Self-organizing map for clustering in the graph domain
• A distance measure between attributed relational graphs for pattern recognition
• 10.1162/153244302760200687
• Automatic Diatom Identification
• Graph-Based Representations in Pattern Recognition
• Structural, Syntactic, and Statistical Pattern Recognition
• Enumeration of Seven-Argument Threshold Functions