• DocumentCode
    3565883
  • Title

    The optimal value of self-connection

  • Author

    Gorodnichy, Dmitry O.

  • Author_Institution
    Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
  • Volume
    1
  • fYear
    1999
  • fDate
    6/21/1905 12:00:00 AM
  • Firstpage
    663
  • Abstract
    The fact that reducing self-connections improves the performance of the autoassociative networks built by the pseudo-inverse learning rule is known already for quite a while, but has not been studied in detail yet. In particular, it is known that decreasing of self-connection increases the direct attraction radius of the network, and it is also known that it increases the number of spurious dynamic attractors. Thus, it has been concluded that the optimal value of the coefficient of self-connection reduction D lies somewhere in the range (0; 0.5). This paper gives an explicit answer to the question on what is the optimal value of the self-connection reduction. It shows how the indirect attraction radius increases with the decrease of D. The summary of the results pertaining to the phenomenon is presented
  • Keywords
    learning (artificial intelligence); neural nets; optimisation; attraction radius; autoassociative networks; dynamic attractors; neural networks; optimisation; pseudo-inverse learning; self-connection; Computer networks; Equations; Neural networks; Neurons; Prototypes; Self-organizing networks; State estimation; Symmetric matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1999. IJCNN '99. International Joint Conference on
  • ISSN
    1098-7576
  • Print_ISBN
    0-7803-5529-6
  • Type

    conf

  • DOI
    10.1109/IJCNN.1999.831579
  • Filename
    831579