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.展开更多
提出了一种模糊最优间隔分布矩阵分类器(Fuzzy Optimal-margin Distribution Matrix Classifier,FODMC)。该模型通过整合模糊隶属度理论与间隔分布优化机制,实现了矩阵结构信息的有效提取与异常值的鲁棒处理。具体而言,FODMC采用基于间...提出了一种模糊最优间隔分布矩阵分类器(Fuzzy Optimal-margin Distribution Matrix Classifier,FODMC)。该模型通过整合模糊隶属度理论与间隔分布优化机制,实现了矩阵结构信息的有效提取与异常值的鲁棒处理。具体而言,FODMC采用基于间隔分布的损失函数来优化分类边界,结合核范数正则化策略保持矩阵的低秩特性,并利用交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)实现模型的高效训练。在多个基准数据集上的实验结果表明:与现有方法相比,FODMC在分类准确率、鲁棒性和泛化能力等方面均展现出显著优势,为矩阵数据分类问题提供了一种有效的解决方案。展开更多
Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is...Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.展开更多
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.展开更多
势支撑向量机P-SVM(potential support vector machine)作为一种新颖的封装型特征选择方法在许多领域得到了成功的运用,然而依据Fisher准则的基本原理发现势支撑向量机方法对应的目标函数只是类内离散度各类均值为0的一种特殊形式,从而...势支撑向量机P-SVM(potential support vector machine)作为一种新颖的封装型特征选择方法在许多领域得到了成功的运用,然而依据Fisher准则的基本原理发现势支撑向量机方法对应的目标函数只是类内离散度各类均值为0的一种特殊形式,从而使该方法的运用受到一定的限制.同时由于要求各类样本均值为0,一定程度上会导致在0矢量周围出现样本交叉,从而不利于P-SVM方法得到最优决策超平面,降低分类效果.因此利用一般的类内散度重新构造目标函数,提出一种广义的势支撑特征选择方法GPSFM(generalized potential support features selection method).GPSFM方法在一定程度上继承了P-SVM的优点,而且还具有特征选择冗余度低、选择速度快和适应能力强的特点,从而使得该方法表现出较之于P-SVM更好的特征选择和分类效果.实验结果表明该方法具有上述优势.展开更多
文摘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.
文摘提出了一种模糊最优间隔分布矩阵分类器(Fuzzy Optimal-margin Distribution Matrix Classifier,FODMC)。该模型通过整合模糊隶属度理论与间隔分布优化机制,实现了矩阵结构信息的有效提取与异常值的鲁棒处理。具体而言,FODMC采用基于间隔分布的损失函数来优化分类边界,结合核范数正则化策略保持矩阵的低秩特性,并利用交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)实现模型的高效训练。在多个基准数据集上的实验结果表明:与现有方法相比,FODMC在分类准确率、鲁棒性和泛化能力等方面均展现出显著优势,为矩阵数据分类问题提供了一种有效的解决方案。
基金supported by the National Natural Science Fundation of China (60736021)the Joint Funds of NSFC-Guangdong Province(U0735003)
文摘Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.
基金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.
文摘势支撑向量机P-SVM(potential support vector machine)作为一种新颖的封装型特征选择方法在许多领域得到了成功的运用,然而依据Fisher准则的基本原理发现势支撑向量机方法对应的目标函数只是类内离散度各类均值为0的一种特殊形式,从而使该方法的运用受到一定的限制.同时由于要求各类样本均值为0,一定程度上会导致在0矢量周围出现样本交叉,从而不利于P-SVM方法得到最优决策超平面,降低分类效果.因此利用一般的类内散度重新构造目标函数,提出一种广义的势支撑特征选择方法GPSFM(generalized potential support features selection method).GPSFM方法在一定程度上继承了P-SVM的优点,而且还具有特征选择冗余度低、选择速度快和适应能力强的特点,从而使得该方法表现出较之于P-SVM更好的特征选择和分类效果.实验结果表明该方法具有上述优势.
