Analysis and pruning of nonlinear auto-association networks
β Scribed by Abbas, H.M.
- Book ID
- 114457777
- Publisher
- The Institution of Electrical Engineers
- Year
- 2004
- Tongue
- English
- Weight
- 271 KB
- Volume
- 151
- Category
- Article
- ISSN
- 1350-245X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Two types of auto-associative networks are well known, one based upon the correlation matrix and the other based upon the orthogonal projection matrix, both of which are calculated from the pattern vectors to be memorized. Although the latter type of networks have a desirable associative property co
In this paper, we consider the problem of how to construct an artificial neuronal network such that it reproduces a given set of patterns in an exact manner. It turns out that the structure of the weight matrix of the network represents the structure of the set of patterns it is acting on, not the p
In the present paper we develop two algorithms, subset-based training (SBT) and subset-based training and pruning (SBTP), using the fact that the Jacobian matrices in sigmoid network training problems are usually rank deficient. The weight vectors are divided into two parts during training, accordin