On Temporal Summation in Chaotic Neural Network with Incremental Learning

Author:

Deguchi Toshinori1,Takahashi Toshiki1,Ishii Naohiro2

Affiliation:

1. Gifu National College of Technology, Gifu, Japan

2. Aichi Institute of Technology, Toyota, Japan

Abstract

The incremental learning is a method to compose an associate memory using a chaotic neural network and provides larger capacity than correlative learning in compensation for a large amount of computation. A chaotic neuron has spatiotemporal summation in it and the temporal summation makes the learning stable to input noise. When there is no noise in input, the neuron may not need temporal summation. In this paper, to reduce the computations, a simplified network without temporal summation is introduced and investigated through the computer simulations comparing with the network as in the past, which is called here the usual network. It turns out that the simplified network has the same capacity in comparison with the usual network and can learn faster than the usual one, but that the simplified network loses the learning ability in noisy inputs. To improve this ability, the parameters in the chaotic neural network are adjusted.

Publisher

IGI Global

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Computer Science Applications,Software

Reference17 articles.

1. Aihara, K., Tanabe, T., & Toyoda, M. (1990). Chaotic neural networks, Phys. Lett. A, 144(6,7), 333–340.

2. Asakawa, S., Deguchi, T., & Ishii, N. (2001). On-Demand Learning in Neural Network, Proc. of the ACIS 2nd Intl. Conf. on Software Engineering, Artificial Intelligence, Networking & Parallel/Distributed Computing (pp.84-89). ACIS.

3. BRAIN CHAOS AND COMPUTATION

4. Chaos as a desirable stable state of artificial neural networks;N. T.Crook;Advances in Soft Computing: Soft Computing Techniques and Applications,2000

5. On Appropriate Refractoriness and Weight Increment in Incremental Learning, LNCS 7824, Adaptive and Natural Computing Algorithms;T.Deguchi;11th International Conference, ICANNGA 2013,2013

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3