Recurrent Neural Network Based Modelling of Industrial Grinding Time Series Data

Ravi kiran Inapakurthi, S. Miriyala, K. Mitra
{"title":"Recurrent Neural Network Based Modelling of Industrial Grinding Time Series Data","authors":"Ravi kiran Inapakurthi, S. Miriyala, K. Mitra","doi":"10.1109/ICC47138.2019.9123235","DOIUrl":null,"url":null,"abstract":"Modelling the time series data generated from a complex and nonlinear industrial grinding unit mandates the use of sophisticated algorithms capable of efficiently approximating the system under consideration. Recurrent Neural Networks, which are proven to be competent enough to approximate many time series systems, can be utilized for identification of industrial grinding circuits. However, the usage of RNNs for system identification tool is limited due to the heuristic estimation of network hyper parameters viz., number of hidden layers to be explored, number of nodes in each hidden layer, activation function and number of previous time instances to be considered for capturing the dynamics of the process. In this study, we address this heuristic approach by proposing an algorithm which can determine the optimal values of these hyper parameters for RNNs. This optimal determination of hyper parameters is done by adopting a multi-objective optimization problem with maximization of the accuracy of the developed model and minimization of the number of nodes in the network as the two conflicting objectives. The performance of the proposed algorithm on a real life industrial grinding circuit data shows its success and competitiveness.","PeriodicalId":231050,"journal":{"name":"2019 Sixth Indian Control Conference (ICC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Sixth Indian Control Conference (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC47138.2019.9123235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Modelling the time series data generated from a complex and nonlinear industrial grinding unit mandates the use of sophisticated algorithms capable of efficiently approximating the system under consideration. Recurrent Neural Networks, which are proven to be competent enough to approximate many time series systems, can be utilized for identification of industrial grinding circuits. However, the usage of RNNs for system identification tool is limited due to the heuristic estimation of network hyper parameters viz., number of hidden layers to be explored, number of nodes in each hidden layer, activation function and number of previous time instances to be considered for capturing the dynamics of the process. In this study, we address this heuristic approach by proposing an algorithm which can determine the optimal values of these hyper parameters for RNNs. This optimal determination of hyper parameters is done by adopting a multi-objective optimization problem with maximization of the accuracy of the developed model and minimization of the number of nodes in the network as the two conflicting objectives. The performance of the proposed algorithm on a real life industrial grinding circuit data shows its success and competitiveness.
基于递归神经网络的工业磨削时间序列数据建模
对复杂的非线性工业磨削装置产生的时间序列数据进行建模要求使用能够有效地逼近所考虑的系统的复杂算法。递归神经网络已被证明足以逼近许多时间序列系统,可用于工业磨削电路的辨识。然而,rnn作为系统识别工具的使用受到限制,因为网络超参数的启发式估计,即要探索的隐藏层的数量,每个隐藏层的节点数量,激活函数和要考虑捕获过程动态的先前时间实例的数量。在本研究中,我们通过提出一种算法来解决这种启发式方法,该算法可以确定rnn的这些超参数的最优值。这种超参数的最优确定是通过采用多目标优化问题来实现的,该问题以所建立模型的精度最大化和网络中节点数量最小化为两个相互冲突的目标。该算法在实际工业磨削电路数据上的性能证明了它的有效性和竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信