Dimension reduction graph‐based sparse subspace clustering for intelligent fault identification of rolling element bearings

Abstract Sparse subspace clustering (SSC) is a spectral clustering methodology. Since high‐dimensional data are often dispersed over the union of many low‐dimensional subspaces, their representation in a suitable dictionary is sparse. Therefore, SSC is an effective technology for diagnosing mechanical system faults. Its main purpose is to create a representation model that can reveal the real subspace structure of high‐dimensional data, construct a similarity matrix by using the sparse representation coefficients of high‐dimensional data, and then cluster the obtained representation coefficients and similarity matrix in subspace. However, the design of SSC algorithm is based on global expression in which each data point is represented by all possible cluster data points. This leads to nonzero terms in nondiagonal blocks of similar matrices, which reduces the recognition performance of matrices. To improve the clustering ability of SSC for rolling bearing and the robustness of the algorithm in the presence of a large number of background noise, a simultaneous dimensionality reduction subspace clustering technology is provided in this work. Through the feature extraction of envelope signal, the dimension of the feature matrix is reduced by singular value decomposition, and the Euclidean distance between samples is replaced by correlation distance. A dimension reduction graph‐based SSC technology is established. Simulation and bearing data of Western Reserve University show that the proposed algorithm can improve the accuracy and compactness of clustering.

Abstract licence: CC BY

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.