Generating feature spaces for linear algorithms with regularized sparse kernel slow feature analysis

Author： Böhmer Wendelin   Grünewälder Steffen   Nickisch Hannes   Obermayer Klaus  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.89, Iss.1-2, 2012-10, pp. : 67-86

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A feature selection method using improved regularized linear discriminant analysis

By Sharma Alok   Paliwal Kuldip   Imoto Seiya   Miyano Satoru  

Machine Vision and Applications, Vol. 25, Iss. 3, 2014-04 ,pp. : 775-786

Springer Publishing Company

Access to resources Recommend Favorite

Stability of feature selection algorithms: a study on high-dimensional spaces

By Kalousis Alexandros   Prados Julien   Hilario Melanie  

Knowledge and Information Systems, Vol. 12, Iss. 1, 2007-05 ,pp. : 95-116

Springer Publishing Company

Access to resources Recommend Favorite

Face recognition based on gradient gabor feature and Efficient Kernel Fisher analysis

By Zhang Baochang   Qiao Yu  

Neural Computing & Applications, Vol. 19, Iss. 4, 2010-06 ,pp. : 617-623

Springer Publishing Company

Access to resources Recommend Favorite

Feature space perspectives for learning the kernel

By Micchelli Charles  

Machine Learning, Vol. 66, Iss. 2-3, 2007-03 ,pp. : 297-319

Springer Publishing Company

Access to resources Recommend Favorite

Image Feature Extraction and Denoising by Sparse Coding

By Oja E.   Hyvärinen A.   Hoyer P.  

Pattern Analysis and Applications (PAA), Vol. 2, Iss. 2, 1999-06 ,pp. : 104-110

Springer Publishing Company

Access to resources Recommend Favorite