The crystallizing substochastic sequential machine extractor: CrySSMEx.
This letter presents an algorithm, CrySSMEx, for extracting minimal finite state machine descriptions of dynamic systems such as recurrent neural networks. Unlike previous algorithms, CrySSMEx is parameter free and deterministic, and it efficiently generates a series of increasingly refined models. A novel finite stochastic model of dynamic systems and a novel vector quantization function have been developed to take into account the state-space dynamics of the system. The experiments show that (1) extraction from systems that can be described as regular grammars is trivial, (2) extraction from high-dimensional systems is feasible, and (3) extraction of approximative models from chaotic systems is possible. The results are promising, and an analysis of shortcomings suggests some possible further improvements. Some largely overlooked connections, of the field of rule extraction from recurrent neural networks, to other fields are also identified.
Jacobsson
Henrik
H
School of Humanities, University of Skövde, Skövde, Sweden. henrik.jacobsson@his.se
D000465:Algorithms; D003627:Data Interpretation, Statistical; D016571:Neural Networks, Computer; D013997:Time Factors