683 search results - page 39 / 137 » Generalization Bounds for Learning Kernels |
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
102
click to vote
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...