A Novel Strategy for Improving the Counter Propagation Artificial Neural Networks in Classification Tasks

IF 0.6 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
S. Belattar, O. Abdoun, E. Haimoudi
{"title":"A Novel Strategy for Improving the Counter Propagation Artificial Neural Networks in Classification Tasks","authors":"S. Belattar, O. Abdoun, E. Haimoudi","doi":"10.24138/jcomss-2021-0121","DOIUrl":null,"url":null,"abstract":"—Counter-Propagation-Artificial-Neural-Networks (C P-ANNs) have been applied in several domains due to their learning and classification abilities. Regardless of their strength, the CP-ANNs still have some limitations in pattern recognition tasks when they encounter ambiguities during the learning process, which leads to the inaccurate classification of the Kohonen-Self-Organizing-Map (K-SOM). This problem has an impact on the performance of the CP-ANNs. Therefore, this paper proposes a novel strategy to improve the CP-ANNs by the Gram-Schmidt algorithm (GSHM) as a pre-processing step of the original data without changing their architecture. Three datasets examples from various domains, such as correlation, crop, and fertilizer, were employed for experimental validation. To obtain the results, we relied on two simulations. The first simulation uses CP-ANNs, and the datasets are inputted into the network without any prior pre-processing. The second simulation uses MCP-ANNs, and the datasets are pre-processed through the GSHM block. Experiment results show that the proposed MCP-ANNs recognize all patterns with a classification accuracy of 100% versus 62.5% for CP-ANNs in the Correlation Dataset. Furthermore, the proposed MCP-ANNs reduce the execution time and training parameter values in all datasets versus CP-ANNs. Thus, the proposed approach based on the GSHM algorithm significantly improves the performance of the CP-ANNs.","PeriodicalId":38910,"journal":{"name":"Journal of Communications Software and Systems","volume":"1 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Communications Software and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24138/jcomss-2021-0121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 3

Abstract

—Counter-Propagation-Artificial-Neural-Networks (C P-ANNs) have been applied in several domains due to their learning and classification abilities. Regardless of their strength, the CP-ANNs still have some limitations in pattern recognition tasks when they encounter ambiguities during the learning process, which leads to the inaccurate classification of the Kohonen-Self-Organizing-Map (K-SOM). This problem has an impact on the performance of the CP-ANNs. Therefore, this paper proposes a novel strategy to improve the CP-ANNs by the Gram-Schmidt algorithm (GSHM) as a pre-processing step of the original data without changing their architecture. Three datasets examples from various domains, such as correlation, crop, and fertilizer, were employed for experimental validation. To obtain the results, we relied on two simulations. The first simulation uses CP-ANNs, and the datasets are inputted into the network without any prior pre-processing. The second simulation uses MCP-ANNs, and the datasets are pre-processed through the GSHM block. Experiment results show that the proposed MCP-ANNs recognize all patterns with a classification accuracy of 100% versus 62.5% for CP-ANNs in the Correlation Dataset. Furthermore, the proposed MCP-ANNs reduce the execution time and training parameter values in all datasets versus CP-ANNs. Thus, the proposed approach based on the GSHM algorithm significantly improves the performance of the CP-ANNs.
一种改进分类任务中反传播人工神经网络的新策略
反传播-人工神经网络(C - P-ANNs)由于其学习和分类能力已被应用于多个领域。无论其强度如何,当在学习过程中遇到歧义时,cp - ann在模式识别任务中仍然存在一定的局限性,这导致了kohonen - self - organization - map (K-SOM)的分类不准确。这个问题会影响到cp - ann的性能。因此,本文提出了一种新的策略,在不改变cp - ann结构的情况下,将Gram-Schmidt算法(GSHM)作为原始数据的预处理步骤来改进cp - ann。采用相关性、作物和肥料等不同领域的三个数据集示例进行实验验证。为了得到结果,我们依靠两次模拟。第一次模拟使用cp - ann,数据集在没有任何预处理的情况下输入到网络中。第二次仿真使用mcp - ann,并通过GSHM块对数据集进行预处理。实验结果表明,所提出的mcp - ann对所有模式的分类准确率为100%,而相关数据集的cp - ann的分类准确率为62.5%。此外,与cp - ann相比,所提出的mcp - ann减少了所有数据集的执行时间和训练参数值。因此,基于GSHM算法的方法显著提高了cp - ann的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Communications Software and Systems
Journal of Communications Software and Systems Engineering-Electrical and Electronic Engineering
CiteScore
2.00
自引率
14.30%
发文量
28
审稿时长
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学术文献互助群
群 号:604180095
Book学术官方微信