Sciweavers

512 search results - page 13 / 103
» Tangent Distance Kernels for Support Vector Machines
Sort
View
NIPS
1998
13 years 8 months ago
Using Analytic QP and Sparseness to Speed Training of Support Vector Machines
Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) problem. This paper proposes an algorithm for training SVMs: Sequential Mi...
John C. Platt
PR
2006
152views more  PR 2006»
13 years 7 months ago
Edit distance-based kernel functions for structural pattern classification
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 i...
Michel Neuhaus, Horst Bunke
ICANN
2001
Springer
13 years 12 months ago
Fast Training of Support Vector Machines by Extracting Boundary Data
Support vector machines have gotten wide acceptance for their high generalization ability for real world applications. But the major drawback is slow training for classification p...
Shigeo Abe, Takuya Inoue
IJCNLP
2005
Springer
14 years 1 months ago
Relation Extraction Using Support Vector Machine
This paper presents a supervised approach for relation extraction. We apply Support Vector Machines to detect and classify the relations in Automatic Content Extraction (ACE) corpu...
Gum-Won Hong
ICML
2000
IEEE
14 years 8 months ago
Bounds on the Generalization Performance of Kernel Machine Ensembles
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
Luis Pérez-Breva, Massimiliano Pontil, Theo...