Regularization method for reduced biquaternion neural network

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Soft Computing Pub Date : 2024-09-04 DOI:10.1016/j.asoc.2024.112206
{"title":"Regularization method for reduced biquaternion neural network","authors":"","doi":"10.1016/j.asoc.2024.112206","DOIUrl":null,"url":null,"abstract":"<div><p>A reduced biquaternion neural network (RQNN) has achieved significant success in machine learning. However, as the reduced biquaternion algebra system contains infinite zero divisors, the RQNN can be easily trapped in a local minimum and overfitting. In this paper, we propose a new regularization scheme for the RQNN to address these issues. Firstly, we propose a new operation in the reduced biquaternion domain named the reduced biquaternion complex modulus (RQCM), which can extract the scale transformation of reduced biquaternions and decrease the unreasonable network constraints caused by constrained phases. Secondly, we mathematically analyse the properties of the reduced biquaternions and obtain the geometric meaning of the RQCM. Finally, we propose an improved weight decay method using the RQCM which can better project the reduced biquaternion in terms of the scale and phase. In addition, our proposed method can effectively solve the non-differentiability of reduced biquaternion matrix and overfitting problem in the process of network parameter updating. The experimental results demonstrate that the proposed method is effective in color image classification and denoising taskas, and outperforms the state of the arts.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624009803","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

A reduced biquaternion neural network (RQNN) has achieved significant success in machine learning. However, as the reduced biquaternion algebra system contains infinite zero divisors, the RQNN can be easily trapped in a local minimum and overfitting. In this paper, we propose a new regularization scheme for the RQNN to address these issues. Firstly, we propose a new operation in the reduced biquaternion domain named the reduced biquaternion complex modulus (RQCM), which can extract the scale transformation of reduced biquaternions and decrease the unreasonable network constraints caused by constrained phases. Secondly, we mathematically analyse the properties of the reduced biquaternions and obtain the geometric meaning of the RQCM. Finally, we propose an improved weight decay method using the RQCM which can better project the reduced biquaternion in terms of the scale and phase. In addition, our proposed method can effectively solve the non-differentiability of reduced biquaternion matrix and overfitting problem in the process of network parameter updating. The experimental results demonstrate that the proposed method is effective in color image classification and denoising taskas, and outperforms the state of the arts.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
还原双四元神经网络的正规化方法
还原双四元神经网络(RQNN)在机器学习领域取得了巨大成功。然而,由于还原双四元代数系统包含无限零除数,RQNN 很容易陷入局部最小值和过拟合。本文提出了一种新的 RQNN 正则化方案来解决这些问题。首先,我们在还原双四元数域中提出了一种新的运算,称为还原双四元数复模(RQCM),它可以提取还原双四元数的尺度变换,减少约束相位造成的不合理网络约束。其次,我们从数学角度分析了还原双四元的特性,并获得了 RQCM 的几何意义。最后,我们利用 RQCM 提出了一种改进的权值衰减方法,该方法能更好地投影出缩减双四元数的尺度和相位。此外,我们提出的方法还能有效解决网络参数更新过程中还原双四元数矩阵的不可分性和过拟合问题。实验结果表明,所提出的方法在彩色图像分类和去噪任务中效果显著,优于现有技术。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
期刊最新文献
An adaptive genetic algorithm with neighborhood search for integrated O2O takeaway order assignment and delivery optimization by e-bikes with varied compartments LesionMix data enhancement and entropy minimization for semi-supervised lesion segmentation of lung cancer A preordonance-based decision tree method and its parallel implementation in the framework of Map-Reduce A personality-guided preference aggregator for ephemeral group recommendation A decomposition-based multi-objective evolutionary algorithm using infinitesimal method
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1