Sciweavers

1235 search results - page 25 / 247
» Learning with Idealized Kernels
Sort
View
ICML
2004
IEEE
14 years 3 months ago
Learning a kernel matrix for nonlinear dimensionality reduction
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
Kilian Q. Weinberger, Fei Sha, Lawrence K. Saul
ML
2006
ACM
121views Machine Learning» more  ML 2006»
13 years 9 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
BMVC
2010
13 years 7 months ago
Generalized RBF feature maps for Efficient Detection
Kernel methods yield state-of-the-art performance in certain applications such as image classification and object detection. However, large scale problems require machine learning...
Sreekanth Vempati, Andrea Vedaldi, Andrew Zisserma...
ICPR
2006
IEEE
14 years 11 months ago
Dimensionality Reduction with Adaptive Kernels
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...
Shuicheng Yan, Xiaoou Tang
CVPR
2010
IEEE
14 years 6 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman