Sparse kernel approximations for efficient classification and detection
Efficient learning with non-linear kernels is often based on extracting features from the data that linearise the kernel. While most constructions aim at obtaining low-dimensional and dense features, in this work we explore high-dimensional and sparse ones. We give a method to compute sparse feature...
| Main Authors: | , |
|---|---|
| Formato: | Conference item |
| Idioma: | English |
| Publicado em: |
IEEE
2012
|