返回
Edit distance-based kernel functions for structural pattern classification
DOI:10.1016/j.patcog.2006.04.012.png)
摘要
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.
Keyword:
string matching
graph matching
edit distance
kernel methods
support vector machine
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
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

