Couner-Propagation Neural Networks Optimization Based on Rough Set

Q1 Social Sciences
Qing Shao
{"title":"Couner-Propagation Neural Networks Optimization Based on Rough Set","authors":"Qing Shao","doi":"10.1109/MVHI.2010.204","DOIUrl":null,"url":null,"abstract":"The Couner-Propagation neural networks is weak in convergent speed, will easily sink into local minimum, and its choices of initial weights and thresholds lack sound basis. So, a new optimal algorithm of neural network based on rough set was proposed. The new approach integrates the advantages of the two algorithms; it has good understandability, simple computation and exact accuracy. Then a new algorithm based rough set was put forward and used to optimize the design of neural network weights and threshold. The results of simulation show: the new algorithm can get over the insufficiency of CP, and compared with CP, greatly improve the convergent accuracy and speed, and get a good measurement result.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"61 1","pages":"495-498"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"HumanMachine Communication Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MVHI.2010.204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 0

Abstract

The Couner-Propagation neural networks is weak in convergent speed, will easily sink into local minimum, and its choices of initial weights and thresholds lack sound basis. So, a new optimal algorithm of neural network based on rough set was proposed. The new approach integrates the advantages of the two algorithms; it has good understandability, simple computation and exact accuracy. Then a new algorithm based rough set was put forward and used to optimize the design of neural network weights and threshold. The results of simulation show: the new algorithm can get over the insufficiency of CP, and compared with CP, greatly improve the convergent accuracy and speed, and get a good measurement result.
基于粗糙集的反传播神经网络优化
反传播神经网络的收敛速度较弱,容易陷入局部最小值,初始权值和阈值的选择缺乏良好的依据。为此,提出了一种新的基于粗糙集的神经网络优化算法。新方法综合了两种算法的优点;该方法易于理解,计算简单,精度准确。然后提出了一种新的基于粗糙集的神经网络权值和阈值的优化设计算法。仿真结果表明:新算法克服了常规算法的不足,与常规算法相比,大大提高了收敛精度和速度,取得了较好的测量效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
10.00
自引率
0.00%
发文量
10
审稿时长
8 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信