Counterpropagation networks
Clicks: 343
ID: 113880
1987
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Star Article
30.0
/100
343 views
60 readers
AI Quality Assessment
Not analyzed
Readership in this journal
StarRanked #16 of 50 articles by views in Applied optics
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
By combining Kohonen learning and Grossberg learning a new type of mapping neural network is obtained. This counterpropagation network (CPN) functions as a statistically optimal self-programming lookup table. The paper begins with some introductory comments, followed by the definition of the CPN. Then a closed-form formula for the error of the network is developed. The paper concludes with a discussion of CPN variants and comments about CPN convergence and performance. References and a neurocomputing bibliography with a combined total of eighty entries are provided.
| Reference Key |
hecht-nielsen1987appliedcounterpropagation
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Robert Hecht-Nielsen;Robert Hecht-Nielsen; |
| Journal | Applied optics |
| Year | 1987 |
| DOI |
doi:10.1364/AO.26.004979
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.