๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks

โœ Scribed by Lu, Yang; Yang, Juan; Wang, Qiang; Huang, ZhenJin


Book ID
113083174
Publisher
Science in China Press (SCP)
Year
2011
Tongue
English
Weight
613 KB
Volume
55
Category
Article
ISSN
1674-733X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Bounds on the number of hidden units in
โœ Masahiko Arai ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 461 KB

For three-layer art~l~cial neural networks (TANs) that take binao, vahtes, the number of hidden units is considered regarding two problems: One is to find the necessary and sufficient number to make mapping between the binary output values of TANs and learning patterns (inputs) arbitrary; and the ot