Sciweavers

19 search results - page 1 / 4
» Efficient Additive Kernels via Explicit Feature Maps
Sort
View
CVPR
2010
IEEE
14 years 27 days 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
BMVC
2010
13 years 2 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...
TIP
2011
162views more  TIP 2011»
12 years 11 months ago
Kernel Maximum Autocorrelation Factor and Minimum Noise Fraction Transformations
—This paper introduces kernel versions of maximum autocorrelation factor (MAF) analysis and minimum noise fraction (MNF) analysis. The kernel versions are based upon a dual formu...
Allan Aasbjerg Nielsen
JMLR
2010
161views more  JMLR 2010»
12 years 11 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
ICPR
2008
IEEE
13 years 11 months ago
Non-linear feature extraction by linear PCA using local kernel
This paper presents how to extract non-linear features by linear PCA. KPCA is effective but the computational cost is the drawback. To realize both non-linearity and low computati...
Kazuhiro Hotta