To solve the multi-class fault diagnosis tasks, decision tree support vector machine （DTSVM）, which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of...To solve the multi-class fault diagnosis tasks, decision tree support vector machine （DTSVM）, which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of DTSVM highly depends on its structure, to cluster the multi-classes with maximum distance between the clustering centers of the two sub-classes, genetic algorithm is introduced into the formation of decision tree, so that the most separable classes would be separated at each node of decisions tree. Numerical simulations conducted on three datasets compared with ＂one-against-all＂ and ＂one-against-one＂ demonstrate the proposed method has better performance and higher generalization ability than the two conventional methods.展开更多
To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPT...To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPTMMM） and a novel support vector machine fuzzy network （SVMFN） classifier is presented. The WPTMMM feature extraction method has less computational complexity, more stability, and has the preferable advantage of robust with the time parallel moving and white noise. Further, the SVMFN uses a new definition of fuzzy density that incorporates accuracy and uncertainty of the classifiers to improve recognition reliability to classify nine digital modulation types （i.e. 2ASK, 2FSK, 2PSK, 4ASK, 4FSK, 4PSK, 16QAM, MSK, and OQPSK）. Computer simulation shows that the proposed scheme has the advantages of high accuracy and reliability （success rates are over 98% when SNR is not lower than 0dB）, and it adapts to engineering applications.展开更多
A semi-supervised vector machine is a relatively new learning method using both labeled and unlabeled data in classifi- cation. Since the objective function of the model for an unstrained semi-supervised vector machin...A semi-supervised vector machine is a relatively new learning method using both labeled and unlabeled data in classifi- cation. Since the objective function of the model for an unstrained semi-supervised vector machine is not smooth, many fast opti- mization algorithms cannot be applied to solve the model. In order to overcome the difficulty of dealing with non-smooth objective functions, new methods that can solve the semi-supervised vector machine with desired classification accuracy are in great demand. A quintic spline function with three-times differentiability at the ori- gin is constructed by a general three-moment method, which can be used to approximate the symmetric hinge loss function. The approximate accuracy of the quintic spiine function is estimated. Moreover, a quintic spline smooth semi-support vector machine is obtained and the convergence accuracy of the smooth model to the non-smooth one is analyzed. Three experiments are performed to test the efficiency of the model. The experimental results show that the new model outperforms other smooth models, in terms of classification performance. Furthermore, the new model is not sensitive to the increasing number of the labeled samples, which means that the new model is more efficient.展开更多
According to the chaotic and non-linear characters of power load data,the time series matrix is established with the theory of phase-space reconstruction,and then Lyapunov exponents with chaotic time series are comput...According to the chaotic and non-linear characters of power load data,the time series matrix is established with the theory of phase-space reconstruction,and then Lyapunov exponents with chaotic time series are computed to determine the time delay and the embedding dimension.Due to different features of the data,data mining algorithm is conducted to classify the data into different groups.Redundant information is eliminated by the advantage of data mining technology,and the historical loads that have highly similar features with the forecasting day are searched by the system.As a result,the training data can be decreased and the computing speed can also be improved when constructing support vector machine(SVM) model.Then,SVM algorithm is used to predict power load with parameters that get in pretreatment.In order to prove the effectiveness of the new model,the calculation with data mining SVM algorithm is compared with that of single SVM and back propagation network.It can be seen that the new DSVM algorithm effectively improves the forecast accuracy by 0.75%,1.10% and 1.73% compared with SVM for two random dimensions of 11-dimension,14-dimension and BP network,respectively.This indicates that the DSVM gains perfect improvement effect in the short-term power load forecasting.展开更多
Vibration-based pavement condition(roughness and obvious anomalies)monitoring has been expanding in road engineering.However,the indistinctive transverse cracking has hardly been considered.Therefore,a vehicle-based n...Vibration-based pavement condition(roughness and obvious anomalies)monitoring has been expanding in road engineering.However,the indistinctive transverse cracking has hardly been considered.Therefore,a vehicle-based novel method is proposed for detecting the transverse cracking through signal processing techniques and support vector machine(SVM).The vibration signals of the car traveling on the transverse-cracked and the crack-free sections were subjected to signal processing in time domain,frequency domain and wavelet domain,aiming to find indices that can discriminate vibration signal between the cracked and uncracked section.These indices were used to form 8 SVM models.The model with the highest accuracy and F1-measure was preferred,consisting of features including vehicle speed,range,relative standard deviation,maximum Fourier coefficient,and wavelet coefficient.Therefore,a crack and crack-free classifier was developed.Then its feasibility was investigated by 2292 pavement sections.The detection accuracy and F1-measure are 97.25%and 85.25%,respectively.The cracking detection approach proposed in this paper and the smartphone-based detection method for IRI and other distress may form a comprehensive pavement condition survey system.展开更多
Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while...Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.展开更多
SVM handles classification problem only considering samples themselves and the classification effect depends on the characteristics of the training samples but not the current information of classified problem.From th...SVM handles classification problem only considering samples themselves and the classification effect depends on the characteristics of the training samples but not the current information of classified problem.From the phenomena of data crossing in systems,this paper improves the classification effect of SVM by adding the prior probability item reflecting the classified problem information into the decision function,which fuses the Bayesian criterion into SVM.The detailed deducing process and realizing steps of the algorithm are put forward.It is verified through two instances.The results showthat the new algorithm has better effect than the traditional SVM algorithm,and its robustness and sensitivity are all improved.展开更多
To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed ...To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model. The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given. An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples.展开更多
为了准确识别气体绝缘开关柜(gas insulated switchgear,GIS)设备的异常工况,提出了一种基于加权梅尔频率谱系数单类支持向量机(Mel frequency cestrum coefficient-one class support vector machine,MFCC-OCSVM)和贝叶斯优化的门控循...为了准确识别气体绝缘开关柜(gas insulated switchgear,GIS)设备的异常工况,提出了一种基于加权梅尔频率谱系数单类支持向量机(Mel frequency cestrum coefficient-one class support vector machine,MFCC-OCSVM)和贝叶斯优化的门控循环单元(bidirectional gate recurrent unit,BiGRU)声纹识别算法。首先,利用基于F统计量的MFCC对声纹数据进行加权特征提取,突出重要特征并减弱噪声的影响,然后利用OCSVM对加权后的特征进行异常检测并去除异常值,提高数据质量。为解决样本不平衡问题,采用合成少数类过采样技术(synthetic minority over-sampling technique,SMOTE)进行声纹样本的均衡。最后,应用基于贝叶斯优化的BiGRU模型进行声纹识别。以某气体绝缘全封闭组合电器(gas insulated switchgear,GIS)为例,采集了20类不同工况下操纵机构的声音样本,与多种经典分类模型进行对比。结果显示,所提算法取得的最高平均识别准确率达到了92.8%,相比于自适应增强、朴素贝叶斯和线性判别分析算法分别提升了30.1%、14.7%和11.5%。通过消融实验进一步评估和验证了所提算法各个流程对声纹识别的实际效果和性能影响,研究成果可为GIS设备异常工况的声纹识别提供高效技术路线。展开更多
Support vector machines （SVMs） are initially designed for binary classification. How to effectively extend them for multiclass classification is still an ongoing research topic. A multiclass classifier is constructe...Support vector machines （SVMs） are initially designed for binary classification. How to effectively extend them for multiclass classification is still an ongoing research topic. A multiclass classifier is constructed by combining SVM^light algorithm with directed acyclic graph SVM （DAGSVM） method, named DAGSVM^light A new method is proposed to select the working set which is identical to the working set selected by SVM^light approach. Experimental results indicate DAGSVM^light is competitive with DAGSMO. It is more suitable for practice use. It may be an especially useful tool for large-scale multiclass classification problems and lead to more widespread use of SVMs in the engineering community due to its good performance.展开更多
On the basis of scale invariant feature transform（SIFT） descriptors,a novel kind of local invariants based on SIFT sequence scale（SIFT-SS） is proposed and applied to target classification.First of all,the merits o...On the basis of scale invariant feature transform（SIFT） descriptors,a novel kind of local invariants based on SIFT sequence scale（SIFT-SS） is proposed and applied to target classification.First of all,the merits of using an SIFT algorithm for target classification are discussed.Secondly,the scales of SIFT descriptors are sorted by descending as SIFT-SS,which is sent to a support vector machine（SVM） with radial based function（RBF） kernel in order to train SVM classifier,which will be used for achieving target classification.Experimental results indicate that the SIFT-SS algorithm is efficient for target classification and can obtain a higher recognition rate than affine moment invariants（AMI） and multi-scale auto-convolution（MSA） in some complex situations,such as the situation with the existence of noises and occlusions.Moreover,the computational time of SIFT-SS is shorter than MSA and longer than AMI.展开更多
In many machine learning problems, a large amount of data is available but only a few of them can be labeled easily. This provides a research branch to effectively combine unlabeled and labeled data to infer the label...In many machine learning problems, a large amount of data is available but only a few of them can be labeled easily. This provides a research branch to effectively combine unlabeled and labeled data to infer the labels of unlabeled ones, that is, to develop transductive learning. In this article, based on Pattern classification via single sphere （SSPC）, which seeks a hypersphere to separate data with the maximum separation ratio, a progressive transductive pattern classification method via single sphere （PTSSPC） is proposed to construct the classifier using both the labeled and unlabeled data. PTSSPC utilize the additional information of the unlabeled samples and obtain better classification performance than SSPC when insufficient labeled data information is available. Experiment results show the algorithm can yields better performance.展开更多
The different approaches used for target decomposition （TD） theory in radar polarimetry are reviewed and three main types of theorems are introduced： those based on Mueller matrix, those using an eigenvector analys...The different approaches used for target decomposition （TD） theory in radar polarimetry are reviewed and three main types of theorems are introduced： those based on Mueller matrix, those using an eigenvector analysis of the coherency matrix, and those employing coherent decomposition of the scattering matrix. Support vector machine （SVM）, as a novel approach in pattern recognition, has demonstrated success in many fields. A new algorithm of target classification, by combining target decomposition and the support vector machine, is proposed. To conduct the experiment, the polarimetric synthetic aperture radar （SAR） data are used. Experimental results show that it is feasible and efficient to target classification by applying target decomposition to extract scattering mechanisms, and the effects of kernel function and its parameters on the classification efficiency are significant.展开更多
Driven by the challenge of integrating large amount of experimental data, classification technique emerges as one of the major and popular tools in computational biology and bioinformatics research. Machine learning m...Driven by the challenge of integrating large amount of experimental data, classification technique emerges as one of the major and popular tools in computational biology and bioinformatics research. Machine learning methods, especially kernel methods with Support Vector Machines （SVMs） are very popular and effective tools. In the perspective of kernel matrix, a technique namely Eigen- matrix translation has been introduced for protein data classification. The Eigen-matrix translation strategy has a lot of nice properties which deserve more exploration. This paper investigates the major role of Eigen-matrix translation in classification. The authors propose that its importance lies in the dimension reduction of predictor attributes within the data set. This is very important when the dimension of features is huge. The authors show by numerical experiments on real biological data sets that the proposed framework is crucial and effective in improving classification accuracy. This can therefore serve as a novel perspective for future research in dimension reduction problems.展开更多
The aim of modulation classification （MC） is to identify the modulation type of a commtmication signal. It plays an important role in many cooperative or noncooperative communication applications. Three spectrogram-...The aim of modulation classification （MC） is to identify the modulation type of a commtmication signal. It plays an important role in many cooperative or noncooperative communication applications. Three spectrogram-based modulation classification methods are proposed. Their recognition scope and performance are investigated or evaluated by theoretical analysis and extensive simulation studies. The method taking moment-like features is robust to frequency offset while the other two, which make use of principal component analysis （PCA） with different transformation inputs, can achieve satisfactory accuracy even at low SNR （as low as 2 dB）. Due to the properties of spectrogram, the statistical pattern recognition techniques, and the image preprocessing steps, all of our methods are insensitive to unknown phase and frequency offsets, timing errors, and the arriving sequence of symbols.展开更多
The pruning algorithms for sparse least squares support vector regression machine are common methods, and easily com- prehensible, but the computational burden in the training phase is heavy due to the retraining in p...The pruning algorithms for sparse least squares support vector regression machine are common methods, and easily com- prehensible, but the computational burden in the training phase is heavy due to the retraining in performing the pruning process, which is not favorable for their applications. To this end, an im- proved scheme is proposed to accelerate sparse least squares support vector regression machine. A major advantage of this new scheme is based on the iterative methodology, which uses the previous training results instead of retraining, and its feasibility is strictly verified theoretically. Finally, experiments on bench- mark data sets corroborate a significant saving of the training time with the same number of support vectors and predictive accuracy compared with the original pruning algorithms, and this speedup scheme is also extended to classification problem.展开更多
基金supported by the National Natural Science Foundation of China (60604021 60874054)
文摘To solve the multi-class fault diagnosis tasks, decision tree support vector machine （DTSVM）, which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of DTSVM highly depends on its structure, to cluster the multi-classes with maximum distance between the clustering centers of the two sub-classes, genetic algorithm is introduced into the formation of decision tree, so that the most separable classes would be separated at each node of decisions tree. Numerical simulations conducted on three datasets compared with ＂one-against-all＂ and ＂one-against-one＂ demonstrate the proposed method has better performance and higher generalization ability than the two conventional methods.
文摘To make the modulation classification system more suitable for signals in a wide range of signal to noise rate （SNR）, a feature extraction method based on signal wavelet packet transform modulus maxima matrix （WPTMMM） and a novel support vector machine fuzzy network （SVMFN） classifier is presented. The WPTMMM feature extraction method has less computational complexity, more stability, and has the preferable advantage of robust with the time parallel moving and white noise. Further, the SVMFN uses a new definition of fuzzy density that incorporates accuracy and uncertainty of the classifiers to improve recognition reliability to classify nine digital modulation types （i.e. 2ASK, 2FSK, 2PSK, 4ASK, 4FSK, 4PSK, 16QAM, MSK, and OQPSK）. Computer simulation shows that the proposed scheme has the advantages of high accuracy and reliability （success rates are over 98% when SNR is not lower than 0dB）, and it adapts to engineering applications.
基金supported by the Fundamental Research Funds for University of Science and Technology Beijing(FRF-BR-12-021)
文摘A semi-supervised vector machine is a relatively new learning method using both labeled and unlabeled data in classifi- cation. Since the objective function of the model for an unstrained semi-supervised vector machine is not smooth, many fast opti- mization algorithms cannot be applied to solve the model. In order to overcome the difficulty of dealing with non-smooth objective functions, new methods that can solve the semi-supervised vector machine with desired classification accuracy are in great demand. A quintic spline function with three-times differentiability at the ori- gin is constructed by a general three-moment method, which can be used to approximate the symmetric hinge loss function. The approximate accuracy of the quintic spiine function is estimated. Moreover, a quintic spline smooth semi-support vector machine is obtained and the convergence accuracy of the smooth model to the non-smooth one is analyzed. Three experiments are performed to test the efficiency of the model. The experimental results show that the new model outperforms other smooth models, in terms of classification performance. Furthermore, the new model is not sensitive to the increasing number of the labeled samples, which means that the new model is more efficient.
基金Supported by National Basic Research Program of China （973 Program） （2005CB321902） National Natural Science Foundation of China （90916024,60727002,60774003）+1 种基金 the Ph.D. Programs Foundation of Ministry of Education of China （20030006003） the Commission on Science,Technology,and Industry for National Defense （A2120061303）
基金Project(70671039) supported by the National Natural Science Foundation of China
文摘According to the chaotic and non-linear characters of power load data,the time series matrix is established with the theory of phase-space reconstruction,and then Lyapunov exponents with chaotic time series are computed to determine the time delay and the embedding dimension.Due to different features of the data,data mining algorithm is conducted to classify the data into different groups.Redundant information is eliminated by the advantage of data mining technology,and the historical loads that have highly similar features with the forecasting day are searched by the system.As a result,the training data can be decreased and the computing speed can also be improved when constructing support vector machine(SVM) model.Then,SVM algorithm is used to predict power load with parameters that get in pretreatment.In order to prove the effectiveness of the new model,the calculation with data mining SVM algorithm is compared with that of single SVM and back propagation network.It can be seen that the new DSVM algorithm effectively improves the forecast accuracy by 0.75%,1.10% and 1.73% compared with SVM for two random dimensions of 11-dimension,14-dimension and BP network,respectively.This indicates that the DSVM gains perfect improvement effect in the short-term power load forecasting.
基金Project(51778482)supported by the National Natural Science Foundation of China。
文摘Vibration-based pavement condition(roughness and obvious anomalies)monitoring has been expanding in road engineering.However,the indistinctive transverse cracking has hardly been considered.Therefore,a vehicle-based novel method is proposed for detecting the transverse cracking through signal processing techniques and support vector machine(SVM).The vibration signals of the car traveling on the transverse-cracked and the crack-free sections were subjected to signal processing in time domain,frequency domain and wavelet domain,aiming to find indices that can discriminate vibration signal between the cracked and uncracked section.These indices were used to form 8 SVM models.The model with the highest accuracy and F1-measure was preferred,consisting of features including vehicle speed,range,relative standard deviation,maximum Fourier coefficient,and wavelet coefficient.Therefore,a crack and crack-free classifier was developed.Then its feasibility was investigated by 2292 pavement sections.The detection accuracy and F1-measure are 97.25%and 85.25%,respectively.The cracking detection approach proposed in this paper and the smartphone-based detection method for IRI and other distress may form a comprehensive pavement condition survey system.
基金supported by the National Natural Science Foundation of China (6057407560705004)
文摘Coordinate descent method is a unconstrained optimization technique. When it is applied to support vector machine （SVM）, at each step the method updates one component of w by solving a one-variable sub-problem while fixing other components. All components of w update after one iteration. Then go to next iteration. Though the method converges and converges fast in the beginning, it converges slow for final convergence. To improve the speed of final convergence of coordinate descent method, Hooke and Jeeves algorithm which adds pattern search after every iteration in coordinate descent method was applied to SVM and a global Newton algorithm was used to solve one-variable subproblems. We proved the convergence of the algorithm. Experimental results show Hooke and Jeeves＇ method does accelerate convergence specially for final convergence and achieves higher testing accuracy more quickly in classification.
文摘SVM handles classification problem only considering samples themselves and the classification effect depends on the characteristics of the training samples but not the current information of classified problem.From the phenomena of data crossing in systems,this paper improves the classification effect of SVM by adding the prior probability item reflecting the classified problem information into the decision function,which fuses the Bayesian criterion into SVM.The detailed deducing process and realizing steps of the algorithm are put forward.It is verified through two instances.The results showthat the new algorithm has better effect than the traditional SVM algorithm,and its robustness and sensitivity are all improved.
基金the National Natural Science Foundation of China (70471074)China Postdoctoral Science Foundation(2005038042)Department of Science and Technology of Guangdong Province(2004B36001051).
文摘To solve the problems of SVM in dealing with large sample size and asymmetric distributed samples, a support vector classification algorithm based on variable parameter linear programming is proposed. In the proposed algorithm, linear programming is employed to solve the optimization problem of classification to decrease the computation time and to reduce its complexity when compared with the original model. The adjusted punishment parameter greatly reduced the classification error resulting from asymmetric distributed samples and the detailed procedure of the proposed algorithm is given. An experiment is conducted to verify whether the proposed algorithm is suitable for asymmetric distributed samples.
文摘Support vector machines （SVMs） are initially designed for binary classification. How to effectively extend them for multiclass classification is still an ongoing research topic. A multiclass classifier is constructed by combining SVM^light algorithm with directed acyclic graph SVM （DAGSVM） method, named DAGSVM^light A new method is proposed to select the working set which is identical to the working set selected by SVM^light approach. Experimental results indicate DAGSVM^light is competitive with DAGSMO. It is more suitable for practice use. It may be an especially useful tool for large-scale multiclass classification problems and lead to more widespread use of SVMs in the engineering community due to its good performance.
基金supported by the National High Technology Research and Development Program (863 Program) (2010AA7080302)
文摘On the basis of scale invariant feature transform（SIFT） descriptors,a novel kind of local invariants based on SIFT sequence scale（SIFT-SS） is proposed and applied to target classification.First of all,the merits of using an SIFT algorithm for target classification are discussed.Secondly,the scales of SIFT descriptors are sorted by descending as SIFT-SS,which is sent to a support vector machine（SVM） with radial based function（RBF） kernel in order to train SVM classifier,which will be used for achieving target classification.Experimental results indicate that the SIFT-SS algorithm is efficient for target classification and can obtain a higher recognition rate than affine moment invariants（AMI） and multi-scale auto-convolution（MSA） in some complex situations,such as the situation with the existence of noises and occlusions.Moreover,the computational time of SIFT-SS is shorter than MSA and longer than AMI.
基金supported by the National Natural Science of China(6057407560705004).
文摘In many machine learning problems, a large amount of data is available but only a few of them can be labeled easily. This provides a research branch to effectively combine unlabeled and labeled data to infer the labels of unlabeled ones, that is, to develop transductive learning. In this article, based on Pattern classification via single sphere （SSPC）, which seeks a hypersphere to separate data with the maximum separation ratio, a progressive transductive pattern classification method via single sphere （PTSSPC） is proposed to construct the classifier using both the labeled and unlabeled data. PTSSPC utilize the additional information of the unlabeled samples and obtain better classification performance than SSPC when insufficient labeled data information is available. Experiment results show the algorithm can yields better performance.
文摘The different approaches used for target decomposition （TD） theory in radar polarimetry are reviewed and three main types of theorems are introduced： those based on Mueller matrix, those using an eigenvector analysis of the coherency matrix, and those employing coherent decomposition of the scattering matrix. Support vector machine （SVM）, as a novel approach in pattern recognition, has demonstrated success in many fields. A new algorithm of target classification, by combining target decomposition and the support vector machine, is proposed. To conduct the experiment, the polarimetric synthetic aperture radar （SAR） data are used. Experimental results show that it is feasible and efficient to target classification by applying target decomposition to extract scattering mechanisms, and the effects of kernel function and its parameters on the classification efficiency are significant.
基金supported by Research Grants Council of Hong Kong under Grant No.17301214HKU CERG Grants,Fundamental Research Funds for the Central Universities+2 种基金the Research Funds of Renmin University of ChinaHung Hing Ying Physical Research Grantthe Natural Science Foundation of China under Grant No.11271144
文摘Driven by the challenge of integrating large amount of experimental data, classification technique emerges as one of the major and popular tools in computational biology and bioinformatics research. Machine learning methods, especially kernel methods with Support Vector Machines （SVMs） are very popular and effective tools. In the perspective of kernel matrix, a technique namely Eigen- matrix translation has been introduced for protein data classification. The Eigen-matrix translation strategy has a lot of nice properties which deserve more exploration. This paper investigates the major role of Eigen-matrix translation in classification. The authors propose that its importance lies in the dimension reduction of predictor attributes within the data set. This is very important when the dimension of features is huge. The authors show by numerical experiments on real biological data sets that the proposed framework is crucial and effective in improving classification accuracy. This can therefore serve as a novel perspective for future research in dimension reduction problems.
文摘The aim of modulation classification （MC） is to identify the modulation type of a commtmication signal. It plays an important role in many cooperative or noncooperative communication applications. Three spectrogram-based modulation classification methods are proposed. Their recognition scope and performance are investigated or evaluated by theoretical analysis and extensive simulation studies. The method taking moment-like features is robust to frequency offset while the other two, which make use of principal component analysis （PCA） with different transformation inputs, can achieve satisfactory accuracy even at low SNR （as low as 2 dB）. Due to the properties of spectrogram, the statistical pattern recognition techniques, and the image preprocessing steps, all of our methods are insensitive to unknown phase and frequency offsets, timing errors, and the arriving sequence of symbols.
基金supported by the National Natural Science Foundation of China(50576033)
文摘The pruning algorithms for sparse least squares support vector regression machine are common methods, and easily com- prehensible, but the computational burden in the training phase is heavy due to the retraining in performing the pruning process, which is not favorable for their applications. To this end, an im- proved scheme is proposed to accelerate sparse least squares support vector regression machine. A major advantage of this new scheme is based on the iterative methodology, which uses the previous training results instead of retraining, and its feasibility is strictly verified theoretically. Finally, experiments on bench- mark data sets corroborate a significant saving of the training time with the same number of support vectors and predictive accuracy compared with the original pruning algorithms, and this speedup scheme is also extended to classification problem.
