683 search results - page 2 / 137 » Generalization Bounds for Learning Kernels |
NIPS
2001
14 years 11 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
JMLR
2010
14 years 4 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
70
Voted
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...