64 search results - page 1 / 13 » Using unsupervised analysis to constrain generalization boun... |
TNN
2010
12 years 11 months ago
2010
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...
ICDAR
2005
IEEE
13 years 10 months ago
2005
IEEE
A binary hierarchical classifier is proposed to solve the multi-class classification problem. We also require rejection of non-target inputs, which thus producing a very difficult...
DAC
2008
ACM
14 years 5 months ago
2008
ACM
Extensive software-based simulation continues to be the mainstream methodology for functional verification of designs. To optimize the use of limited simulation resources, coverag...
TIT
2002
13 years 4 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
COLT
1999
Springer
13 years 8 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...