Multi-sliced Sampling-based Deep Forest Regression Algorithm for High-dimension Data

Heng Xia, Jian Tang, J. Qiao, Wen Yu
{"title":"Multi-sliced Sampling-based Deep Forest Regression Algorithm for High-dimension Data","authors":"Heng Xia, Jian Tang, J. Qiao, Wen Yu","doi":"10.1109/IAI50351.2020.9262209","DOIUrl":null,"url":null,"abstract":"In the online soft measurement of difficult-to-measure parameters of complex industrial processes. With the rapid development of investigation, deep learning such as deep forest regression (DFR) have been applied. However, for high-dimension datasets, these methods usually can't implement better effects and high time cost. Therefore, in this paper, a multi-sliced sampling-based DFR (Mss-DFR) model is proposed to solve the above problems in high-dimension datasets. The improved model is different from the original model in three important aspects. Firstly, considering the diversity and time cost of sub-forest, the raw feature vector is segmented into three parts through multi slicing strategy. Further, based on the mutual information feature selection model, the optimized feature set is obtained that according to the principle of minimum redundancy and maximum correlation, and then combined with the layer regression vector. Finally, consider variance can projection effect the difference of each sub-forest in DFR, so that it added to the layer regression vector. Experimental results show that Mss-DFR performs significantly, and even outperforms neural networks and achieves state-of-the-art results in some cases.","PeriodicalId":137183,"journal":{"name":"2020 2nd International Conference on Industrial Artificial Intelligence (IAI)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Industrial Artificial Intelligence (IAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAI50351.2020.9262209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In the online soft measurement of difficult-to-measure parameters of complex industrial processes. With the rapid development of investigation, deep learning such as deep forest regression (DFR) have been applied. However, for high-dimension datasets, these methods usually can't implement better effects and high time cost. Therefore, in this paper, a multi-sliced sampling-based DFR (Mss-DFR) model is proposed to solve the above problems in high-dimension datasets. The improved model is different from the original model in three important aspects. Firstly, considering the diversity and time cost of sub-forest, the raw feature vector is segmented into three parts through multi slicing strategy. Further, based on the mutual information feature selection model, the optimized feature set is obtained that according to the principle of minimum redundancy and maximum correlation, and then combined with the layer regression vector. Finally, consider variance can projection effect the difference of each sub-forest in DFR, so that it added to the layer regression vector. Experimental results show that Mss-DFR performs significantly, and even outperforms neural networks and achieves state-of-the-art results in some cases.
基于多切片采样的高维数据深度森林回归算法
在复杂工业过程中难以测量参数的在线软测量中。随着研究的迅速发展,深度学习如深度森林回归(DFR)得到了应用。然而,对于高维数据集,这些方法通常不能实现较好的效果,且时间成本高。因此,本文提出了一种基于多切片采样的DFR (Mss-DFR)模型来解决高维数据集中的上述问题。改进后的模型与原模型在三个重要方面有所不同。首先,考虑到森林的多样性和时间成本,采用多切片策略将原始特征向量分割成三个部分;进一步,在互信息特征选择模型的基础上,根据最小冗余、最大相关原则得到优化后的特征集,并与层回归向量相结合。最后,考虑方差可以投影影响各子林在DFR中的差异,使其加入到层回归向量中。实验结果表明,Mss-DFR的性能显著,在某些情况下甚至优于神经网络,达到了最先进的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信