Generating feature spaces for linear algorithms with regularized sparse kernel slow feature analysis
DOI10.1007/s10994-012-5300-0zbMath1260.68321OpenAlexW2126461605MaRDI QIDQ1945126
Wendelin Böhmer, Klaus Obermayer, Hannes Nickisch, Steffen Grünewälder
Publication date: 2 April 2013
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-012-5300-0
time serieslatent variablesunsupervised learninglinear classificationslow feature analysissparse kernel methods
Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- A new sufficient condition for the strong convergence of Halpern type iterations
- Learning viewpoint invariant object representations using a temporal coherence principle
- Blind Source Separation Using Temporal Predictability
- Sparse On-Line Gaussian Processes
- Reducing the Dimensionality of Data with Neural Networks
- Slow Feature Analysis: Unsupervised Learning of Invariances
- Slow Feature Analysis: A Theoretical Analysis of Optimal Free Responses
- Matching pursuits with time-frequency dictionaries
- A Fast Learning Algorithm for Deep Belief Nets
This page was built for publication: Generating feature spaces for linear algorithms with regularized sparse kernel slow feature analysis
