Understanding state space organization in recurrent neural networks with iterative function systems dynamics

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study a novel recurrent network architecture with dyna-mics of iterative function systems used in chaos game representations of DNA sequences [16,11]. We show that such networks code the tempo-ral and statistical structure of input sequences in a strict mathematical sense: generalized dimensions of network states are in direct correspon-dence with statistical properties of input sequences expressed via genera-lized Renyi entropy spectra. We also argue and experimentally illustrate that the commonly used heuristic of finite state machine extraction by network state space quantization corresponds in this case to variable memory length Markov model construction.

Cite

CITATION STYLE

APA

Tino, P., Dorffner, G., & Schittenkopf, C. (2000). Understanding state space organization in recurrent neural networks with iterative function systems dynamics. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1778, pp. 255–269). Springer Verlag. https://doi.org/10.1007/10719871_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free