By Topic

Comments on "Constructive learning of recurrent neural networks: limitations of recurrent cascade correlation and a simple solution"

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kremer, S.C. ; Communication Res. Centre, Ottawa, Ont., Canada

Giles et al. (1995) have proven that Fahlman's recurrent cascade correlation (RCC) architecture is not capable of realizing finite state automata that have state-cycles of length more than two under a constant input signal. This paper extends the conclusions of Giles et al. by showing that there exists a corollary to their original proof which identifies a large second class of automata, that is also unrepresentable by RCC.

Published in:

Neural Networks, IEEE Transactions on  (Volume:7 ,  Issue: 4 )