Nonlinear Process Monitoring Based on Global Preserving Unsupervised Kernel Extreme Learning Machine
Hanyuan Zhang, Xiaogang Deng, Yunchu Zhang and 3 more
IEEE Access · 2019
doi:10.1109/access.2019.2932017 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Recently, the unsupervised extreme learning machine (UELM) technique as a nonlinear data mining approach has been employed to diagnose nonlinear process faults. However, during the dimensionality reduction of process observation data, UELM only aims at mining the local structure feature information of process data and lacks of the ability of preserving the global structure analysis of process data, which would perform unsatisfactorily for monitoring nonlinear process. Furthermore, the choice of the optimal number of hidden layer nodes in UELM method is still a challenging problem. To handle these two tough problems, a new fault detection approach on the basis of global preserving unsupervised kernel extreme learning machine (GUKELM) technique is proposed to monitor nonlinear process effectively. In GUKELM technique, the data global structure preserving framework is naturally incorporated into standard UELM to capture the local structure information as well as to preserve the global structure feature information of nonlinear process observation data during the dimensionality reduction. Meanwhile, to tackle the strong nonlinearity of process observation data, the kernel trick is utilized to successfully solve the challenging issue of setting the optimal number of hidden layer nodes. Based on extracted process data low dimensional feature information from GUKELM method, support vector data description algorithm is adopted to construct the monitoring statistic to detect process fault. Finally, the feasibility and effectiveness of the proposed process monitoring strategy is illustrated through a numerical nonlinear system and the continuous stirred tank reactor process which is a typical nonlinear process.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.