83 search results - page 9 / 17 » Rademacher Chaos Complexities for Learning the Kernel Proble... |
MTA
2006
13 years 7 months ago
2006
Abstract. Query-by-example and query-by-keyword both suffer from the problem of "aliasing," meaning that example-images and keywords potentially have variable interpretat...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper, we derive a data mining framework to analyze 3D features on human faces. The framework leverages kernel density estimators, genetic algorithm and an information com...
ICML
2004
IEEE
14 years 8 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...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
JMLR
2010
13 years 2 months ago
2010
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...