Regularized sparse kernel slow feature analysis

Böhmer, W. and Grunewalder, S. and Nickisch, H. and Obermayer, K. (2011) Regularized sparse kernel slow feature analysis. In: Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2011. Lecture Notes in Computer Science . Springer, Berlin, pp. 235-248. ISBN 9783642237799

Full text not available from this repository.


This paper develops a kernelized slow feature analysis (SFA) algorithm. SFA is an unsupervised learning method to extract features which encode latent variables from time series. Generative relationships are usually complex, and current algorithms are either not powerful enough or tend to over-fit. We make use of the kernel trick in combination with sparsification to provide a powerful function class for large data sets. Sparsity is achieved by a novel matching pursuit approach that can be applied to other tasks as well. For small but complex data sets, however, the kernel SFA approach leads to over-fitting and numerical instabilities. To enforce a stable solution, we introduce regularization to the SFA objective. Versatility and performance of our method are demonstrated on audio and video data sets.

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
Deposited By:
Deposited On:
07 Mar 2017 11:58
Last Modified:
15 Sep 2023 01:54