节点文献

参数化模糊联想记忆网络的学习算法

Learning algorithm for parameterized fuzzy associative memory

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 唐良荣吴建华徐蔚鸿

【Author】 TANG Liang-rong1,WU Jian-hua1,XU Wei-hong1,21.College of Computer and Communications Engineering,Changsha University of Science and Technology,Changsha 410077,China 2.College of Mathematics and Computer Science,Jishou University,Jishou,Hunan 416000,China

【机构】 长沙理工大学计算机与通信工程学院吉首大学数学与计算机科学学院

【摘要】 基于Dubois提出的带参数ξ的t-模Tξ,提出了一种参数化的广义模糊联想记忆网络Max-TξFAM。由于Tξ中参数ξ的作用,在应用中Max-TξFAM有更强的可调性和灵活性。接着利用Tξ的伴随蕴涵算子,提出了Max-TξFAM的一种有效学习算法。从理论上严格证明了,只要Max-TξFAM能完整可靠地存储所给的多个模式对,则所提出的学习算法一定能找到使得网络能完整可靠存储这些模式对的所有连接权矩阵的最大者。最后,用实验说明了所提出的学习算法的有效性。

【Abstract】 Based on fuzzy composition of maximum operation and a t-norm Tξ with a parameter ξ proposed by Dubois,a param-eterized general fuzzy associate memory Max-Tξ FAM is presented in this paper.By adjusting parameter ξ,the Max-Tξ FAM has good adaptability and flexibility in practice.Taking advantage of the concomitant implication operator of Tξ,a simple effective learning algorithm is proposed for the Max-Tξ FAM.It is proved theoretically that,for arbitrary given training pattern pairs,if the Max-Tξ FAM has ability to store them reliably and completely,then the proposed learning algorithm can find the maximum of all connected weight matrices which can ensure that the Max-Tξ FAM stores reliably these pattern pairs.Finally an experiment is given to illustrate the effectivity of the presented learning algorithm.

【基金】 国家自然科学基金No.60033020;国家教育部重点科研基金项目No.208098;湖南省教育厅重点科研项目No.07A056~~
  • 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2009年12期
  • 【分类号】TP181
  • 【被引频次】2
  • 【下载频次】58
节点文献中: 

本文链接的文献网络图示:

本文的引文网络