Sciweavers

1244 search results - page 4 / 249
» A Simple Decomposition Method for Support Vector Machines
Sort
View
GPEM
2008
128views more  GPEM 2008»
13 years 7 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
AVBPA
2003
Springer
140views Biometrics» more  AVBPA 2003»
14 years 28 days ago
Combining SVM Classifiers for Multiclass Problem: Its Application to Face Recognition
Abstract. In face recognition, a simple classifier such as NNk − is frequently used. For a robust system, it is common to construct the multiclass classifier by combining the out...
Jaepil Ko, Hyeran Byun
LWA
2004
13 years 9 months ago
A Simple Method For Estimating Conditional Probabilities For SVMs
Support Vector Machines (SVMs) have become a popular learning algorithm, in particular for large, high-dimensional classification problems. SVMs have been shown to give most accur...
Stefan Rüping
ESANN
2007
13 years 9 months ago
The Intrinsic Recurrent Support Vector Machine
In this work, we present a new model for a Recurrent Support Vector Machine. We call it intrinsic because the complete recurrence is directly incorporated within the considered opt...
Daniel Schneegaß, Anton Maximilian Schä...
PAMI
2006
128views more  PAMI 2006»
13 years 7 months ago
Multisurface Proximal Support Vector Machine Classification via Generalized Eigenvalues
A new approach to support vector machine (SVM) classification is proposed wherein each of two data sets are proximal to one of two distinct planes that are not parallel to each oth...
Olvi L. Mangasarian, Edward W. Wild