Return
Edit distance-based kernel functions for structural pattern classification
DOI:10.1016/j.patcog.2006.04.012.png)
Abstract
En 中文
A common approach in structural pattern classification is to define a dissimilarity measure on patterns and apply a distance-based nearest-neighbor classifier. In this paper, we introduce an alternative method for classification using kernel functions based on edit distance. The proposed approach is applicable to both string and graph representations of patterns. By means of the kernel functions introduced in this paper, string and graph classification can be performed in an implicit vector space using powerful statistical algorithms. The validity of the kernel method cannot be established for edit distance in general. However, by evaluating theoretical criteria we show that the kernel functions are nevertheless suitable for classification, and experiments on various string and graph datasets clearly demonstrate that nearest-neighbor classifiers can be outperformed by support vector machines using the proposed kernel functions. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
string matching
graph matching
edit distance
kernel methods
support vector machine
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
Controls on the mineralogical and geochemical dispersion in soil and water around a tailing storage facility in the epithermal gold–silver mine in Central Kalimantan, Indonesia
Geochemistry
IF0
Generalizing edit distance to incorporate domain information: Handwritten text recognition as a case study
PATTERN RECOGNITION
IF7.6

