TWO LEARNING ALGORITHMS OF HOPFIELD ASSOCIATIVE MEMORY BASED ON MINIMAX CRITERION
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Based on the idea that the domains of attraction of all memorizad patterns must possess balanced shape,a minimax criterion for design of HoFfield associative memo-ry,which requires the smallest domain of attraction to be maximized,is proposed in this paper.A quick learning algorithm is first given,and furtherly,a constrained perception optimization algorithm is developed.A large number of simulation results confirm advan-tages of these algorithms given in this paper over existing ones.

    Reference
    Related
    Cited by
Get Citation

梁学斌,吴立德.基于极大极小准则的Hopfield联想记忆学习算法*.软件学报,1996,7(zk):267-272

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 07,1995
  • Revised:
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063