Regularized Sparse Kernel Slow Feature Analysis
Abstract
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.
Cite
Text
Böhmer et al. "Regularized Sparse Kernel Slow Feature Analysis." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2011. doi:10.1007/978-3-642-23780-5_25Markdown
[Böhmer et al. "Regularized Sparse Kernel Slow Feature Analysis." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2011.](https://mlanthology.org/ecmlpkdd/2011/bohmer2011ecmlpkdd-regularized/) doi:10.1007/978-3-642-23780-5_25BibTeX
@inproceedings{bohmer2011ecmlpkdd-regularized,
title = {{Regularized Sparse Kernel Slow Feature Analysis}},
author = {Böhmer, Wendelin and Grünewälder, Steffen and Nickisch, Hannes and Obermayer, Klaus},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2011},
pages = {235-248},
doi = {10.1007/978-3-642-23780-5_25},
url = {https://mlanthology.org/ecmlpkdd/2011/bohmer2011ecmlpkdd-regularized/}
}