83 search results - page 7 / 17 » Rademacher Chaos Complexities for Learning the Kernel Proble... |
164
click to vote
PAMI
2011
14 years 11 months ago
2011
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...
160
click to vote
TNN
2010
14 years 11 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
136
click to vote
ICASSP
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— This work considers a combination classificationregression based framework with the proposal of using learned kernels in modified support vector regression to provide...
162
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Latent Variable Models (LVM), like the Shared-GPLVM
and the Spectral Latent Variable Model, help mitigate over-
fitting when learning discriminative methods from small or
modera...
170
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...