Genetic design of discrete dynamical basis networks that approximate data sequences and functions

Author： Jones Kent L. Wild Thomas N. Olmsted David L.

ISSN： 1464-5319

Source： International Journal of Systems Science, Vol.35, Iss.13-14, 2004-10, pp. : 801-814

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

This paper extends research in the area of biologically inspired, discrete dynamical basis networks (DDBNs). While similar to locally recurrent globally feedforward (LRGF) networks ( Tsoi and Back 1994 ), DDBNs operate at a lower level of abstraction and were inspired by research in the areas of Control Systems, Artificial Intelligence, and Neurobiology. As described previously, DDBNs can approximate data sequences and consist of networks of simple, bounded mathematical operators ( Jones and Olmsted 2003 ). This paper examines the characteristics of genetically designed DDBNs and compares them with tree-based genetic programs (TBGPs), biological neural networks, and backpropagation neural networks (NNs). Experimental evidence indicates that DDBNs are capable of computing simple logic functions in addition to approximating data sequences.