283 search results - page 2 / 57 » Bounds on the Generalization Performance of Kernel Machine E... |
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
A two-class imbalanced data problem (IDP) emerges when the data from majority class are compactly clustered and the data from minority class are scattered. Though a discriminative...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence ...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
JMLR
2008
13 years 4 months ago
2008
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
IJCNN
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...