Algebraic properties of recurrent neural networks of discrete time
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 5 (2005) no. 1-2, pp. 116-128
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Artificial neural networks сan be used effectively for а quite general class of problems. Still there exists nо formal foundation of some important constructions used in the theory. ln this paper an attempt is undertaken to formalize some concepts of neuroinformatics and consider their properties from the point of view of applied universal algebra. lt is proposed to treat neural networks as heterogeneous algebras which has made it possible to prove for them basic results similar to algebraic theorems оn homomorphisms and congruences.
[1] McCulloc W. S., Pitts W. N., “A logical calculus of the ideas immanent in nervous activity”, Bull. of Math. Biophysics, 5 (1943), 115–133 | DOI | MR | Zbl
[2] Psiola V. V., “Obzor osnovnykh neirosetevykh modelei”, Intellektualnye sistemy, 4:3–4 (1999), 139–172
[3] Bogomolov A. M., Salii V. N., Algebraicheskie osnovy teorii diskretnykh sistem, M., 1997, 11
[4] Carrasco R. C., Mikel J. O., Forcada L., Efficient Encodings of finite automata in discrete-time recurrent neural networks, http://www.dlsi.ua.es/m̃lf/docum/carrasco99p.pdf