• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于训练具有等距节点的插值径向基函数网络的高效算法。

Efficient algorithm for training interpolation RBF networks with equally spaced nodes.

作者信息

Huan Hoang Xuan, Hien Dang Thi Thu, Tue Huynh Huu

机构信息

College of Technology, Vietnam National University, Hanoi, Vietnam.

出版信息

IEEE Trans Neural Netw. 2011 Jun;22(6):982-8. doi: 10.1109/TNN.2011.2120619. Epub 2011 May 10.

DOI:10.1109/TNN.2011.2120619
PMID:21558059
Abstract

This brief paper proposes a new algorithm to train interpolation Gaussian radial basis function (RBF) networks in order to solve the problem of interpolating multivariate functions with equally spaced nodes. Based on an efficient two-phase algorithm recently proposed by the authors, Euclidean norm associated to Gaussian RBF is now replaced by a conveniently chosen Mahalanobis norm, that allows for directly computing the width parameters of Gaussian radial basis functions. The weighting parameters are then determined by a simple iterative method. The original two-phase algorithm becomes a one-phase one. Simulation results show that the generality of networks trained by this new algorithm is sensibly improved and the running time significantly reduced, especially when the number of nodes is large.

摘要

本文简要提出了一种新的算法来训练插值高斯径向基函数(RBF)网络,以解决在等距节点上对多元函数进行插值的问题。基于作者最近提出的一种高效的两阶段算法,现在将与高斯RBF相关的欧几里得范数替换为方便选择的马氏范数,这使得可以直接计算高斯径向基函数的宽度参数。然后通过一种简单的迭代方法确定加权参数。原来的两阶段算法变成了单阶段算法。仿真结果表明,用这种新算法训练的网络的通用性得到了显著提高,运行时间显著减少,特别是在节点数量较大时。

相似文献

1
Efficient algorithm for training interpolation RBF networks with equally spaced nodes.用于训练具有等距节点的插值径向基函数网络的高效算法。
IEEE Trans Neural Netw. 2011 Jun;22(6):982-8. doi: 10.1109/TNN.2011.2120619. Epub 2011 May 10.
2
Training reformulated radial basis function neural networks capable of identifying uncertainty in data classification.训练能够识别数据分类中不确定性的重新构建的径向基函数神经网络。
IEEE Trans Neural Netw. 2006 Sep;17(5):1222-34. doi: 10.1109/TNN.2006.877538.
3
Higher-order-statistics-based radial basis function networks for signal enhancement.基于高阶统计量的径向基函数网络用于信号增强。
IEEE Trans Neural Netw. 2007 May;18(3):823-32. doi: 10.1109/TNN.2007.891185.
4
Concurrent subspace width optimization method for RBF neural network modeling.RBF 神经网络建模的共空间维数优化方法。
IEEE Trans Neural Netw Learn Syst. 2012 Feb;23(2):247-59. doi: 10.1109/TNNLS.2011.2178560.
5
A hybrid forward algorithm for RBF neural network construction.一种用于径向基函数神经网络构建的混合前向算法。
IEEE Trans Neural Netw. 2006 Nov;17(6):1439-51. doi: 10.1109/TNN.2006.880860.
6
Adaptive computation algorithm for RBF neural network.RBF 神经网络的自适应计算算法。
IEEE Trans Neural Netw Learn Syst. 2012 Feb;23(2):342-7. doi: 10.1109/TNNLS.2011.2178559.
7
Data classification with radial basis function networks based on a novel kernel density estimation algorithm.基于一种新型核密度估计算法的径向基函数网络数据分类
IEEE Trans Neural Netw. 2005 Jan;16(1):225-36. doi: 10.1109/TNN.2004.836229.
8
A growing and pruning method for radial basis function networks.一种径向基函数网络的生长与修剪方法。
IEEE Trans Neural Netw. 2009 Jun;20(6):1039-45. doi: 10.1109/TNN.2009.2019270. Epub 2009 May 15.
9
Fault detection and diagnosis for non-Gaussian stochastic distribution systems with time delays via RBF neural networks.基于 RBF 神经网络的时滞非高斯随机分布系统故障检测与诊断。
ISA Trans. 2012 Nov;51(6):786-91. doi: 10.1016/j.isatra.2012.07.003. Epub 2012 Aug 14.
10
Bidirectional extreme learning machine for regression problem and its learning effectiveness.双向极端学习机在回归问题中的应用及其学习有效性。
IEEE Trans Neural Netw Learn Syst. 2012 Sep;23(9):1498-505. doi: 10.1109/TNNLS.2012.2202289.

引用本文的文献

1
Prediction of Labor Unemployment Based on Time Series Model and Neural Network Model.基于时间序列模型和神经网络模型的劳动力失业预测。
Comput Intell Neurosci. 2022 Jun 3;2022:7019078. doi: 10.1155/2022/7019078. eCollection 2022.