Sciweavers

44 search results - page 7 / 9
» Learning the kernel parameters in kernel minimum distance cl...
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 5 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
ICML
2008
IEEE
14 years 6 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
13 years 9 months ago
Support vector regression for classifier prediction
In this paper we introduce XCSF with support vector prediction: the problem of learning the prediction function is solved as a support vector regression problem and each classifie...
Daniele Loiacono, Andrea Marelli, Pier Luca Lanzi
NIPS
2004
13 years 7 months ago
Object Classification from a Single Example Utilizing Class Relevance Metrics
We describe a framework for learning an object classifier from a single example. This goal is achieved by emphasizing the relevant dimensions for classification using available ex...
Michael Fink 0002
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
13 years 6 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue