Abstract
In this paper, we aim to develop novel learning approaches for extracting invariant features from time series. Specifically, we implement an existing method of solving the generalized eigenproblem and use this to firstly implement the biologically inspired technique of slow feature analysis (SFA) originally developed by Wiskott and Sejnowski (Neural Comput 14:715-770, 2002) and a rival method derived earlier by Stone (Neural Comput 8(7):1463-1492, 1996). Secondly, we investigate preprocessing the data using echo state networks (ESNs) (Lukosevicius and Jaeger in Comput Sci Rev 3(3):127-149, 2009) and show that the combination of generalized eigensolver and ESN is very powerful as a more biologically plausible implementation of SFA. Thirdly, we also investigate the effect of higher-order derivatives as a smoothing constraint and show the overall smoothness in the output signal. We demonstrate the potential of our proposed techniques, benchmarked against state-of-the-art approaches, using datasets comprising artificial, MNIST digits and hand-written character trajectories.
| Original language | English |
|---|---|
| Pages (from-to) | 595-607 |
| Number of pages | 13 |
| Journal | Cognitive Computation |
| Volume | 6 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 2014 |
| Externally published | Yes |
Keywords
- Echo state network
- GenEigSfa
- Generalized eigenvalue problem
- Higher-order changes
- Recurrent Neural Network
- Slow feature analysis
- Stone's criterion
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Computer Science Applications
- Cognitive Neuroscience
Fingerprint
Dive into the research topics of 'Novel Biologically Inspired Approaches to Extracting Online Information from Temporal Data'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver