Edit distance-based kernel functions for structural pattern classification
From MaRDI portal
Publication:2498678
DOI10.1016/j.patcog.2006.04.012zbMath1096.68140OpenAlexW2097827365MaRDI QIDQ2498678
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
Related Items (10)
Topographic Mapping of Large Dissimilarity Data Sets ⋮ A quantum Jensen-Shannon graph kernel for unattributed graphs ⋮ Shape classification by manifold learning in multiple observation spaces ⋮ A theory of subtree matching and tree kernels based on the edit distance concept ⋮ The journey of graph kernels through two decades ⋮ Indefinite Proximity Learning: A Review ⋮ Learning state machine-based string edit kernels ⋮ Dissimilarity between two skeletal trees in a context ⋮ Measuring linearity of connected configurations of a finite number of 2D and 3D curves ⋮ Convex graph invariant relaxations for graph edit distance
Uses Software
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
This page was built for publication: Edit distance-based kernel functions for structural pattern classification
