One-class classification problem has become a popular problem in many fields, with a wide range of applications in anomaly detection, fault diagnosis, and face recognition. We investigate the one-class classification ...One-class classification problem has become a popular problem in many fields, with a wide range of applications in anomaly detection, fault diagnosis, and face recognition. We investigate the one-class classification problem for second-order tensor data. Traditional vector-based one-class classification methods such as one-class support vector machine (OCSVM) and least squares one-class support vector machine (LSOCSVM) have limitations when tensor is used as input data, so we propose a new tensor one-class classification method, LSOCSTM, which directly uses tensor as input data. On one hand, using tensor as input data not only enables to classify tensor data, but also for vector data, classifying it after high dimensionalizing it into tensor still improves the classification accuracy and overcomes the over-fitting problem. On the other hand, different from one-class support tensor machine (OCSTM), we use squared loss instead of the original loss function so that we solve a series of linear equations instead of quadratic programming problems. Therefore, we use the distance to the hyperplane as a metric for classification, and the proposed method is more accurate and faster compared to existing methods. The experimental results show the high efficiency of the proposed method compared with several state-of-the-art methods.展开更多
Hierarchical Support Vector Machine （H-SVM） is faster in training and classification than other usual multi-class SVMs such as ＂1-V-R＂and ＂1-V-1＂. In this paper, a new multi-class fault diagnosis algorithm based...Hierarchical Support Vector Machine （H-SVM） is faster in training and classification than other usual multi-class SVMs such as ＂1-V-R＂and ＂1-V-1＂. In this paper, a new multi-class fault diagnosis algorithm based on H-SVM is proposed and applied to aero-engine. Before SVM training, the training data are first clustered according to their class-center Euclid distances in some feature spaces. The samples which have close distances are divided into the same sub-classes for training, and this makes the H-SVM have reasonable hierarchical construction and good generalization performance. Instead of the common C-SVM, the v-SVM is selected as the binary classifier, in which the parameter v varies only from 0 to 1 and can be determined more easily. The simulation results show that the designed H-SVMs can fast diagnose the multi-class single faults and combination faults for the gas path components of an aero-engine. The fault classifiers have good diagnosis accuracy and can keep robust even when the measurement inputs are disturbed by noises.展开更多
Turbopump condition monitoring is a significant approach to ensure the safety of liquid rocket engine （LRE）.Because of lack of fault samples,a monitoring system cannot be trained on all possible condition patterns.T...Turbopump condition monitoring is a significant approach to ensure the safety of liquid rocket engine （LRE）.Because of lack of fault samples,a monitoring system cannot be trained on all possible condition patterns.Thus it is important to differentiate abnormal or unknown patterns from normal pattern with novelty detection methods.One-class support vector machine （OCSVM） that has been commonly used for novelty detection cannot deal well with large scale samples.In order to model the normal pattern of the turbopump with OCSVM and so as to monitor the condition of the turbopump,a monitoring method that integrates OCSVM with incremental clustering is presented.In this method,the incremental clustering is used for sample reduction by extracting representative vectors from a large training set.The representative vectors are supposed to distribute uniformly in the object region and fulfill the region.And training OCSVM on these representative vectors yields a novelty detector.By applying this method to the analysis of the turbopump＇s historical test data,it shows that the incremental clustering algorithm can extract 91 representative points from more than 36 000 training vectors,and the OCSVM detector trained on these 91 representative points can recognize spikes in vibration signals caused by different abnormal events such as vane shedding,rub-impact and sensor faults.This monitoring method does not need fault samples during training as classical recognition methods.The method resolves the learning problem of large samples and is an alternative method for condition monitoring of the LRE turbopump.展开更多
Based on the framework of support vector machines （SVM） using one-against-one （OAO） strategy, a new multi-class kernel method based on directed aeyclie graph （DAG） and probabilistic distance is proposed to raise...Based on the framework of support vector machines （SVM） using one-against-one （OAO） strategy, a new multi-class kernel method based on directed aeyclie graph （DAG） and probabilistic distance is proposed to raise the multi-class classification accuracies. The topology structure of DAG is constructed by rearranging the nodes＇ sequence in the graph. DAG is equivalent to guided operating SVM on a list, and the classification performance depends on the nodes＇ sequence in the graph. Jeffries-Matusita distance （JMD） is introduced to estimate the separability of each class, and the implementation list is initialized with all classes organized according to certain sequence in the list. To testify the effectiveness of the proposed method, numerical analysis is conducted on UCI data and hyperspectral data. Meanwhile, comparative studies using standard OAO and DAG classification methods are also conducted and the results illustrate better performance and higher accuracy of the orooosed JMD-DAG method.展开更多
In this paper, a support vector machine-based multi-model predictive control is proposed, in which SVM classification combines well with SVM regression. At first, each working environment is modeled by SVM regression ...In this paper, a support vector machine-based multi-model predictive control is proposed, in which SVM classification combines well with SVM regression. At first, each working environment is modeled by SVM regression and the support vector machine network-based model predictive control （SVMN-MPC） algorithm corresponding to each environment is developed, and then a multi-class SVM model is established to recognize multiple operating conditions. As for control, the current environment is identified by the multi-class SVM model and then the corresponding SVMN-MPC controller is activated at each sampling instant. The proposed modeling, switching and controller design is demonstrated in simulation results.展开更多
Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for ...Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for each pairs of points. Based on the proximity graph model [3], the Euclidean distance in Hilbert space is calculated using a Gaussian kernel, which is the right criterion to generate a minimum spanning tree using Kruskal's algorithm. Then the connectivity estimation is lowered by only checking the linkages between the edges that construct the main stem of the MST (Minimum Spanning Tree), in which the non-compatibility degree is originally defined to support the edge selection during linkage estimations. This new approach is experimentally analyzed. The results show that the revised algorithm has a better performance than the proximity graph model with faster speed, optimized clustering quality and strong ability to noise suppression, which makes SVC scalable to large data sets.展开更多
In this paper, we propose an improved Directed Acyclic Graph Support Vector Machine （DAGSVM） for multi-class classification. Compared with the traditional DAGSVM, the improved version has advantages that the structu...In this paper, we propose an improved Directed Acyclic Graph Support Vector Machine （DAGSVM） for multi-class classification. Compared with the traditional DAGSVM, the improved version has advantages that the structure of the directed acyclic graph is not chosen random and fixed, and it can be adaptive to be optimal according to the incoming testing samples, thus it has a good generalization performance. From experiments on six datasets, we can see that the proposed improved version of DAGSVM is better than the traditional one with respect to the accuracy rate.展开更多
文摘One-class classification problem has become a popular problem in many fields, with a wide range of applications in anomaly detection, fault diagnosis, and face recognition. We investigate the one-class classification problem for second-order tensor data. Traditional vector-based one-class classification methods such as one-class support vector machine (OCSVM) and least squares one-class support vector machine (LSOCSVM) have limitations when tensor is used as input data, so we propose a new tensor one-class classification method, LSOCSTM, which directly uses tensor as input data. On one hand, using tensor as input data not only enables to classify tensor data, but also for vector data, classifying it after high dimensionalizing it into tensor still improves the classification accuracy and overcomes the over-fitting problem. On the other hand, different from one-class support tensor machine (OCSTM), we use squared loss instead of the original loss function so that we solve a series of linear equations instead of quadratic programming problems. Therefore, we use the distance to the hyperplane as a metric for classification, and the proposed method is more accurate and faster compared to existing methods. The experimental results show the high efficiency of the proposed method compared with several state-of-the-art methods.
基金University Science Foundation of Jiangsu Province (04KJD510018)
文摘Hierarchical Support Vector Machine （H-SVM） is faster in training and classification than other usual multi-class SVMs such as ＂1-V-R＂and ＂1-V-1＂. In this paper, a new multi-class fault diagnosis algorithm based on H-SVM is proposed and applied to aero-engine. Before SVM training, the training data are first clustered according to their class-center Euclid distances in some feature spaces. The samples which have close distances are divided into the same sub-classes for training, and this makes the H-SVM have reasonable hierarchical construction and good generalization performance. Instead of the common C-SVM, the v-SVM is selected as the binary classifier, in which the parameter v varies only from 0 to 1 and can be determined more easily. The simulation results show that the designed H-SVMs can fast diagnose the multi-class single faults and combination faults for the gas path components of an aero-engine. The fault classifiers have good diagnosis accuracy and can keep robust even when the measurement inputs are disturbed by noises.
基金supported by National Natural Science Foundation of China (Grant No. 50675219)Hu’nan Provincial Science Committee Excellent Youth Foundation of China (Grant No. 08JJ1008)
文摘Turbopump condition monitoring is a significant approach to ensure the safety of liquid rocket engine （LRE）.Because of lack of fault samples,a monitoring system cannot be trained on all possible condition patterns.Thus it is important to differentiate abnormal or unknown patterns from normal pattern with novelty detection methods.One-class support vector machine （OCSVM） that has been commonly used for novelty detection cannot deal well with large scale samples.In order to model the normal pattern of the turbopump with OCSVM and so as to monitor the condition of the turbopump,a monitoring method that integrates OCSVM with incremental clustering is presented.In this method,the incremental clustering is used for sample reduction by extracting representative vectors from a large training set.The representative vectors are supposed to distribute uniformly in the object region and fulfill the region.And training OCSVM on these representative vectors yields a novelty detector.By applying this method to the analysis of the turbopump＇s historical test data,it shows that the incremental clustering algorithm can extract 91 representative points from more than 36 000 training vectors,and the OCSVM detector trained on these 91 representative points can recognize spikes in vibration signals caused by different abnormal events such as vane shedding,rub-impact and sensor faults.This monitoring method does not need fault samples during training as classical recognition methods.The method resolves the learning problem of large samples and is an alternative method for condition monitoring of the LRE turbopump.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61201310)the Fundamental Research Funds for the Central Universities(Grant No.HIT.NSRIF.201160)the China Postdoctoral Science Foundation(Grant No.20110491067)
文摘Based on the framework of support vector machines （SVM） using one-against-one （OAO） strategy, a new multi-class kernel method based on directed aeyclie graph （DAG） and probabilistic distance is proposed to raise the multi-class classification accuracies. The topology structure of DAG is constructed by rearranging the nodes＇ sequence in the graph. DAG is equivalent to guided operating SVM on a list, and the classification performance depends on the nodes＇ sequence in the graph. Jeffries-Matusita distance （JMD） is introduced to estimate the separability of each class, and the implementation list is initialized with all classes organized according to certain sequence in the list. To testify the effectiveness of the proposed method, numerical analysis is conducted on UCI data and hyperspectral data. Meanwhile, comparative studies using standard OAO and DAG classification methods are also conducted and the results illustrate better performance and higher accuracy of the orooosed JMD-DAG method.
基金the 973 Program of China (No.2002CB312200)the National Science Foundation of China (No.60574019)
文摘In this paper, a support vector machine-based multi-model predictive control is proposed, in which SVM classification combines well with SVM regression. At first, each working environment is modeled by SVM regression and the support vector machine network-based model predictive control （SVMN-MPC） algorithm corresponding to each environment is developed, and then a multi-class SVM model is established to recognize multiple operating conditions. As for control, the current environment is identified by the multi-class SVM model and then the corresponding SVMN-MPC controller is activated at each sampling instant. The proposed modeling, switching and controller design is demonstrated in simulation results.
基金TheNationalHighTechnologyResearchandDevelopmentProgramofChina (No .86 3 5 11 930 0 0 9)
文摘Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for each pairs of points. Based on the proximity graph model [3], the Euclidean distance in Hilbert space is calculated using a Gaussian kernel, which is the right criterion to generate a minimum spanning tree using Kruskal's algorithm. Then the connectivity estimation is lowered by only checking the linkages between the edges that construct the main stem of the MST (Minimum Spanning Tree), in which the non-compatibility degree is originally defined to support the edge selection during linkage estimations. This new approach is experimentally analyzed. The results show that the revised algorithm has a better performance than the proximity graph model with faster speed, optimized clustering quality and strong ability to noise suppression, which makes SVC scalable to large data sets.
文摘In this paper, we propose an improved Directed Acyclic Graph Support Vector Machine （DAGSVM） for multi-class classification. Compared with the traditional DAGSVM, the improved version has advantages that the structure of the directed acyclic graph is not chosen random and fixed, and it can be adaptive to be optimal according to the incoming testing samples, thus it has a good generalization performance. From experiments on six datasets, we can see that the proposed improved version of DAGSVM is better than the traditional one with respect to the accuracy rate.
