• DocumentCode
    285353
  • Title

    Unlearning algorithm in associative memories: eigenstructure method

  • Author

    Yen, G. ; Michel, A.N.

  • Author_Institution
    Dept. of Electr. Eng., Notre Dame Univ., IN, USA
  • Volume
    1
  • fYear
    1992
  • fDate
    10-13 May 1992
  • Firstpage
    355
  • Abstract
    Unlearning capabilities are incorporated into a synthesis procedure for a class of discrete-time neural networks. The proposed technique increases storing capacity while maximizing the domain of attraction of each desired pattern to be stored. Making use of learning, forgetting, and unlearning capabilities, networks generated by the method advanced herein are capable of learning new patterns as well as forgetting learned patterns without the necessity of recomputing all the interconnection weights and external inputs. The unlearning algorithm developed is then utilized to equalize the basins of attraction for each desired pattern to be stored in a given network, and to minimize the number of spurious states. Examples are given to illustrate the strengths and weaknesses of the methodologies
  • Keywords
    content-addressable storage; discrete time systems; eigenvalues and eigenfunctions; learning (artificial intelligence); neural nets; associative memories; attraction basins; discrete-time neural networks; eigenstructure method; forgetting; interconnection weights; learning; synthesis procedure; unlearning algorithm; Algorithm design and analysis; Associative memory; Design methodology; Difference equations; Intelligent networks; Inverse problems; Network synthesis; Neural networks; Neurons; Stability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    0-7803-0593-0
  • Type

    conf

  • DOI
    10.1109/ISCAS.1992.229940
  • Filename
    229940