Abstract

This study describes a dynamic large-scale process fault detection algorithm based on multi-block slow feature analysis by taking advantages of both multi-block algorithms in highlighting the local information and slow feature analysis in extracting the different dynamics of process data. A mutual information-based relevance matrix is first calculated to measure the correlation between any two variables, and then K-means clustering is used to cluster the original variables into several blocks by gathering the variables with similar relevance vectors into the same block. Slow feature analysis is applied in each block. A support vector data description is utilized to give a final decision. The proposed algorithm is tested with a well-known Tennessee Eastman (TE) process. The fault detection results show the efficiency and the superiority of the proposed method as compared to other related methods.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call