Sciweavers

283 search results - page 9 / 57
» Bounds on the Generalization Performance of Kernel Machine E...
Sort
View
ESANN
2006
13 years 8 months ago
Immune Network based Ensembles
This paper presents a new method for constructing ensembles of classifiers based on immune network theory, one of the most interesting paradigms within the field of artificial imm...
Nicolás García-Pedrajas, Colin Fyfe
AAAI
2008
13 years 9 months ago
Dimension Amnesic Pyramid Match Kernel
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
Yi Liu, Xulei Wang, Hongbin Zha
ICML
2006
IEEE
14 years 8 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
TNN
2010
143views Management» more  TNN 2010»
13 years 2 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 7 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio