Learning Algorithms ot Bidirectional Associative Memory Based on Max-Min Criterion

梁学斌; 吴立德

您当前的位置：

首页 >

文章列表页 >

Learning Algorithms ot Bidirectional Associative Memory Based on Max-Min Criterion

更新时间：2025-12-08

- Learning Algorithms ot Bidirectional Associative Memory Based on Max-Min Criterion
- Acta Electronica Sinica Issue 8, (1996)
- 作者机构：
  
  复旦大学计算机科学系
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP18
- Published：1996
- 稿件说明：
移动端阅览
[1]梁学斌,吴立德.基于极大极小准则的异联想记忆网络学习算法[J].电子学报,1996(08):28-32+14.

梁学斌, 吴立德. Learning Algorithms ot Bidirectional Associative Memory Based on Max-Min Criterion[J]. Acta Electronica Sinica, 1996, (8).
[1]梁学斌,吴立德.基于极大极小准则的异联想记忆网络学习算法[J].电子学报,1996(08):28-32+14. DOI：

梁学斌, 吴立德. Learning Algorithms ot Bidirectional Associative Memory Based on Max-Min Criterion[J]. Acta Electronica Sinica, 1996, (8). DOI：

摘要

提出了设计异联想记忆网络的极大极小准则，即设计出的连接权阵应使得网络最小的记忆模式对的吸引域达到最大．首先给出了一种快速学习算法，它设计出的网络连接权值只取１，０或－１；再进一步发展了一个启发性迭代学习算法，称为约束感知器优化学习算法，它以快速学习算法的结果作为连接权阵的迭代初值．计算机实验结果表明了所提学习算法的优越性．

Abstract

A max-min criterion for design of bidirectional associative memory

which requires the smallest domain of attraction to be maximized

is proposed in this paper. A quick learning algorithm is first given

by which the designed connection weights are 1

0 or -1. Further

a constrained perceptron optimization algorithm is presented

which takes the weights obtained by quick algorithm as initial iteration value. Computer experimental results confirm the advantages of the proposed algorithms.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰