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 spa...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.展开更多
Due to the large scale and high dimension of teaching data,the using of traditional clustering algorithms has problems such as high computational complexity and low accuracy.Therefore,this paper proposes a weighted bl...Due to the large scale and high dimension of teaching data,the using of traditional clustering algorithms has problems such as high computational complexity and low accuracy.Therefore,this paper proposes a weighted block sparse subspace clustering algorithm based on information entropy.The introduction of information entropy weight and block diagonal constraints can obtain the prior probability that two pixels belong to the same category before the simulation experiment,thereby positively intervening that the solutions solved by the model tend to be the optimal approximate solutions of the block diagonal structure.It can enable the model to obtain the performance against noise and outliers,and thereby improving the discriminative ability of the model classification.The experimental results show that the average probability Rand index of the proposed method is 0.86,which is higher than that of other algorithms.The average information change index of the proposed method is 1.55,which is lower than that of other algorithms,proving its strong robustness.On different datasets,the misclassification rates of the design method are 1.2%and 0.9%respectively,which proves that its classification accuracy is relatively high.The proposed method has high reliability in processing highdimensional teaching data.It can play an important role in the field of educational data analysis and provide strong support for intelligent teaching.展开更多
基金The present work is supported by the National Key R&D Program(No.2020YFB2007700)the National Natural Science Foundation of China(Nos.11790282,11802184,11902205,12002221,12032017)+1 种基金the S&T Program of Hebei(No.20310803D)the Natural Science Foundation of Hebei Province(No.A2020210028).
文摘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.
文摘Due to the large scale and high dimension of teaching data,the using of traditional clustering algorithms has problems such as high computational complexity and low accuracy.Therefore,this paper proposes a weighted block sparse subspace clustering algorithm based on information entropy.The introduction of information entropy weight and block diagonal constraints can obtain the prior probability that two pixels belong to the same category before the simulation experiment,thereby positively intervening that the solutions solved by the model tend to be the optimal approximate solutions of the block diagonal structure.It can enable the model to obtain the performance against noise and outliers,and thereby improving the discriminative ability of the model classification.The experimental results show that the average probability Rand index of the proposed method is 0.86,which is higher than that of other algorithms.The average information change index of the proposed method is 1.55,which is lower than that of other algorithms,proving its strong robustness.On different datasets,the misclassification rates of the design method are 1.2%and 0.9%respectively,which proves that its classification accuracy is relatively high.The proposed method has high reliability in processing highdimensional teaching data.It can play an important role in the field of educational data analysis and provide strong support for intelligent teaching.
