๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Constructing a speculative kernel machine for pattern classification

โœ Scribed by Arindam Choudhury; Prasanth B. Nair; Andy J. Keane


Book ID
104065344
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
153 KB
Volume
19
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.

โœฆ Synopsis


We propose and investigate the performance of a new geometry-based algorithm designed to identify potentially informative data points for classification. An incremental QR update scheme is used to build a classifier using a subset of these points as radial basis function centers. The minimum descriptive length and the leave-one-out error criteria are employed for automatic model selection. The proposed scheme is shown to generate parsimonious models, which perform generalization comparable to the state-of-the-art support and relevance vector machines.


๐Ÿ“œ SIMILAR VOLUMES


Edit distance-based kernel functions for
โœ Michel Neuhaus; Horst Bunke ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 498 KB

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