Sciweavers

406 search results - page 40 / 82
» Covering Numbers for Support Vector Machines
Sort
View
ICANN
2009
Springer
14 years 9 months ago
MINLIP: Efficient Learning of Transformation Models
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
GPEM
2008
128views more  GPEM 2008»
14 years 12 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
ICIP
2010
IEEE
14 years 9 months ago
Natural DCT statistics approach to no-reference image quality assessment
General-purpose no-reference image quality assessment approaches still lag the advances in full-reference methods. Most no-reference methods are either distortion specific (i.e. t...
Michele A. Saad, Alan C. Bovik, Christophe Charrie...
ICASSP
2011
IEEE
14 years 3 months ago
Effective background data selection in SVM speaker recognition for unseen test environment: More is not always better
This study focuses on determining a procedure to select effective negative examples for development of improved Support Vector Machine (SVM) based speaker recognition. Selection o...
Jun-Won Suh, Yun Lei, Wooil Kim, John H. L. Hansen
IJCNN
2007
IEEE
15 years 6 months ago
Upper Bound on Pattern Storage in Feedforward Networks
—Starting from the strict interpolation equations for multivariate polynomials, an upper bound is developed for the number of patterns that can be memorized by a nonlinear feedfo...
Pramod Lakshmi Narasimha, Michael T. Manry, Franci...