• DocumentCode
    1105004
  • Title

    Optimum learning for bidirectional associative memory in the sense of capacity

  • Author

    Chi Sing Leung

  • Author_Institution
    Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Shatin
  • Volume
    24
  • Issue
    5
  • fYear
    1994
  • fDate
    5/1/1994 12:00:00 AM
  • Firstpage
    791
  • Lastpage
    796
  • Abstract
    Borrowing the idea of the perceptron, bidirectional learning (BL) is proposed to enhance the recall performance of bidirectional associative memory (BAM). By modifying the proof of convergence of the perceptron, the author has proved that BL yields one of the solution connection matrices within a finite number of iterations (if the solutions exist). According to the above convergence of BL, the capacity of BAM with BL is larger than or equal to that with any other learning rule. Hence, BL can be considered as an optimum learning rule for BAM in the sense of capacity. Simulations show that BL greatly improves the capacity and the error correction capability of BAM
  • Keywords
    content-addressable storage; convergence; error correction; learning (artificial intelligence); bidirectional associative memory; bidirectional learning; capacity; error correction capability; learning rule; optimum learning; perceptron; proof of convergence; recall performance; solution connection matrices; Associative memory; Computer science; Convergence; Encoding; Error correction; Libraries; Magnesium compounds; Neural networks; Neurons; Pattern recognition;
  • fLanguage
    English
  • Journal_Title
    Systems, Man and Cybernetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9472
  • Type

    jour

  • DOI
    10.1109/21.293495
  • Filename
    293495