利用建设性学习识别多元发酵过程

L. Meleiro, R.J.G.B. Campello, R. M. Filho, F. V. Zuben
{"title":"利用建设性学习识别多元发酵过程","authors":"L. Meleiro, R.J.G.B. Campello, R. M. Filho, F. V. Zuben","doi":"10.1109/SBRN.2002.1181429","DOIUrl":null,"url":null,"abstract":"In the present work, a constructive learning algorithm is employed to design an optimal one-hidden neural network structure that best approximates a given mapping. The method determines not only the optimal number of hidden neurons but also the best activation function for each node. Here, the projection pursuit technique is applied in association with the optimization of the solvability condition, giving rise to a more efficient and accurate computational learning algorithm. As each activation function of a hidden neuron is optimally defined for every approximation problem, better rates of convergence are achieved. Since the training process operates the hidden neurons individually, a pertinent activation function employing Hermite polynomials can be iteratively developed for each neuron as a function of the learning set. The proposed constructive learning algorithm was successfully applied to identify a large-scale multivariate process, providing a multivariable model that was able to describe the complex process dynamics, even in long-range horizon predictions.","PeriodicalId":157186,"journal":{"name":"VII Brazilian Symposium on Neural Networks, 2002. SBRN 2002. Proceedings.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Identification of a multivariate fermentation process using constructive learning\",\"authors\":\"L. Meleiro, R.J.G.B. Campello, R. M. Filho, F. V. Zuben\",\"doi\":\"10.1109/SBRN.2002.1181429\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the present work, a constructive learning algorithm is employed to design an optimal one-hidden neural network structure that best approximates a given mapping. The method determines not only the optimal number of hidden neurons but also the best activation function for each node. Here, the projection pursuit technique is applied in association with the optimization of the solvability condition, giving rise to a more efficient and accurate computational learning algorithm. As each activation function of a hidden neuron is optimally defined for every approximation problem, better rates of convergence are achieved. Since the training process operates the hidden neurons individually, a pertinent activation function employing Hermite polynomials can be iteratively developed for each neuron as a function of the learning set. The proposed constructive learning algorithm was successfully applied to identify a large-scale multivariate process, providing a multivariable model that was able to describe the complex process dynamics, even in long-range horizon predictions.\",\"PeriodicalId\":157186,\"journal\":{\"name\":\"VII Brazilian Symposium on Neural Networks, 2002. SBRN 2002. Proceedings.\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"VII Brazilian Symposium on Neural Networks, 2002. SBRN 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SBRN.2002.1181429\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"VII Brazilian Symposium on Neural Networks, 2002. SBRN 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBRN.2002.1181429","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本工作中,采用建设性学习算法来设计最优的单隐神经网络结构,该结构最接近给定映射。该方法不仅确定了隐藏神经元的最优数量,而且确定了每个节点的最佳激活函数。在这里,投影寻踪技术与可解性条件的优化相结合,产生了一种更高效、更准确的计算学习算法。由于隐藏神经元的每个激活函数对每个逼近问题都是最优定义的,因此可以获得更好的收敛速度。由于训练过程单独操作隐藏的神经元,因此可以为每个神经元迭代地开发一个相关的激活函数,作为学习集的函数。提出的建设性学习算法成功地应用于识别大规模的多变量过程,提供了一个能够描述复杂过程动态的多变量模型,即使在长期视界预测中也是如此。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Identification of a multivariate fermentation process using constructive learning
In the present work, a constructive learning algorithm is employed to design an optimal one-hidden neural network structure that best approximates a given mapping. The method determines not only the optimal number of hidden neurons but also the best activation function for each node. Here, the projection pursuit technique is applied in association with the optimization of the solvability condition, giving rise to a more efficient and accurate computational learning algorithm. As each activation function of a hidden neuron is optimally defined for every approximation problem, better rates of convergence are achieved. Since the training process operates the hidden neurons individually, a pertinent activation function employing Hermite polynomials can be iteratively developed for each neuron as a function of the learning set. The proposed constructive learning algorithm was successfully applied to identify a large-scale multivariate process, providing a multivariable model that was able to describe the complex process dynamics, even in long-range horizon predictions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信