改进的多类支持向量机递归特征消除在癌症多分类中的应用

为处理癌症多分类问题,已经提出了多类支持向量机递归特征消除(MSVM-RFE)方法,但该方法考虑的是所有子分类器的权重融合,忽略了各子分类器自身挑选特征的能力。为提高多分类问题的识别率,提出了一种改进的多类支持向量机递归特征消除(MMSVM-RFE)方法。所提方法利用一对多策略把多类问题化解为多个两类问题,每个两类问题均采用支持向量机递归特征消除来逐渐剔除掉冗余特征,得到一个特征子集;然后将得到的多个特征子集合并得到最终的特征子集;最后用SVM分类器对获得的特征子集进行建模。在3个基因数据集上的实验结果表明,改进的算法整体识别率提高了大约2%,单个类别的精度有大幅度提升甚至100%。与随机森林、k近邻分类器以及主成分分析(PCA)降维方法的比较均验证了所提算法的优势。     

基于特征加权的支持向量回归机研究

基于统计学习理论的支持向量回归机有比较好的泛化能力,然而当样本含有与该问题不完全相关甚至完全无关的特征时,会使得各个特征对问题的相关程度差异很大,从而使得支持向量回归机的效果受到影响。为了解决这个问题,提出了一种基于特征加权的支持向量回归机。模拟的计算结果显示出此方法的有效性。     

Improved support vector classification using PCA and ICA feature space modification

An approach that unifies subspace feature selection and optimal classification is presented. Independent component analysis (ICA) and principal component analysis (PCA) provide a maximally variant or statistically independent basis for pattern recognition. A support vector classifier (SVC) provides information about the significance of each feature vector. The feature vectors and the principal and independent component bases are modified to obtain classification results which provide lower classification error and better generalization than can be obtained by the SVC on the raw data and its PCA or ICA subspace representation. The performance of the approach is demonstrated with artificial data sets and an example of face recognition from an image database.     

Classification of silent speech using support vector machine and relevance vector machine

To provide speech prostheses for individuals with severe communication impairments, we investigated a classification method for brain computer interfaces (BCIs) using silent speech. Event-related potentials (ERPs) were recorded using scalp electrodes when five subjects imagined the vocalization of Japanese vowels, /a/, /i/, /u/, /e/, and /o/ in order and in random order, while the subjects remained silent and immobilized.For actualization, we tried to apply relevance vector machine (RVM) and RVM with Gaussian kernel (RVM-G) instead of support vector machine with Gaussian kernel (SVM-G) to reduce the calculation cost in the use of 19 channels, common special patterns (CSPs) filtering, and adaptive collection (AC). Results show that using RVM-G instead of SVM-G reduced the ratio of the number of efficient vectors to the number of training data from 97% to 55%. At this time, the averaged classification accuracies (CAs) using SVM-G and RVM-G were, respectively, 77% and 79%, showing no degradation. However, the calculation cost was more than that using SVM-G because RVM-G necessitates high calculation costs for optimization. Furthermore, results show that CAs using RVM-G were weaker than SVM-G when the training data were few. Additionally, results showed that nonlinear classification was necessary for silent speech classification.This paper serves as a beginning of feasibility study for speech prostheses using an imagined voice. Although classification for silent speech presents great potential, many feasibility problems remain.     

Design efficient support vector machine for fast classification

This paper presents a four-step training method for increasing the efficiency of support vector machine (SVM). First, a SVM is initially trained by all the training samples, thereby producing a number of support vectors. Second, the support vectors, which make the hypersurface highly convoluted, are excluded from the training set. Third, the SVM is re-trained only by the remaining samples in the training set. Finally, the complexity of the trained SVM is further reduced by approximating the separation hypersurface with a subset of the support vectors. Compared to the initially trained SVM by all samples, the efficiency of the finally-trained SVM is highly improved, without system degradation.     

Human motion recognition using support vector machines

We propose a motion recognition strategy that represents each videoclip by a set of filtered images, each of which corresponds to a frame. Using a filtered-image classifier based on support vector machines, we classify a videoclip by applying majority voting over the predicted labels of its filtered images and, for online classification, we identify the most likely type of action at any moment by applying majority voting over the predicted labels of the filtered images within a sliding window. We also define a classification confidence and the associated threshold in both cases, which enable us to identify the existence of an unknown type of motion and, together with the proposed recognition strategy, make it possible to build a real-time motion recognition system that cannot only make classifications in real-time, but also learn new types of motions and recognize them in the future. The proposed strategy is demonstrated on real datasets.     

Color image segmentation using pixel wise support vector machine classification

Image segmentation is an important tool in image processing and can serve as an efficient front end to sophisticated algorithms and thereby simplify subsequent processing. In this paper, we present a color image segmentation using pixel wise support vector machine (SVM) classification. Firstly, the pixel-level color feature and texture feature of the image, which is used as input of SVM model (classifier), are extracted via the local homogeneity model and Gabor filter. Then, the SVM model (classifier) is trained by using FCM with the extracted pixel-level features. Finally, the color image is segmented with the trained SVM model (classifier). This image segmentation not only can fully take advantage of the local information of color image, but also the ability of SVM classifier. Experimental evidence shows that the proposed method has a very effective segmentation results and computational behavior, and decreases the time and increases the quality of color image segmentation in comparison with the state-of-the-art segmentation methods recently proposed in the literature.     

Color image segmentation using automatic pixel classification with support vector machine

Automatic segmentation of images is a very challenging fundamental task in computer vision and one of the most crucial steps toward image understanding. In this paper, we present a color image segmentation using automatic pixel classification with support vector machine (SVM). First, the pixel-level color feature is extracted in consideration of human visual sensitivity for color pattern variations, and the image pixel's texture feature is represented via steerable filter. Both the pixel-level color feature and texture feature are used as input of SVM model (classifier). Then, the SVM model (classifier) is trained by using fuzzy c-means clustering (FCM) with the extracted pixel-level features. Finally, the color image is segmented with the trained SVM model (classifier). This image segmentation not only can fully take advantage of the local information of color image, but also the ability of SVM classifier. Experimental evidence shows that the proposed method has a very effective segmentation results and computational behavior, and decreases the time and increases the quality of color image segmentation in compare with the state-of-the-art segmentation methods recently proposed in the literature.     

基于支持向量机的流量分类方法*

针对现有流量分类方法存在的准确率低、应用范围受限、计算复杂度高等问题,提出使用支持向量机方法来解决流量分类问题。使用公开的人工标注数据集作为训练集和测试集,通过有监督学习构建支持向量机流量分类器。此外,通过实验进一步分析了训练集大小、核函数、惩罚因子等因素对支持向量机分类性能的影响。实验结果表明支持向量机分类器可以达到98%以上的流分类准确率。     

基于特征选择和支持向量机的异常检测方法

针对异常检测系统虚警率高、检测率低以及冗余特征对检测系统造成负担的问题,提出一种基于特征选择和支持向量机相结合的异常检测方法.该方法通过构造一种基于分类模型分类准确率计算的特征选择算法,筛选出能够获得分类准确率最高的特征组合,并与支持向量机分类算法相结合,实现数据的异常检测.仿真测试结果表明,该方法具有较高的检测准确率和较低的检测时间,并通过去除噪声特征,降低了系统的数据处理难度.     

Statistical analysis of mammographic features and its classification using support vector machine

This study aims at designing a support vector machine (SVM)-based classifier for breast cancer detection with higher degree of accuracy. It introduces a best possible training scheme of the features extracted from the mammogram, by first selecting the kernel function and then choosing a suitable training-test partition. Prior to classification, detailed statistical analysis viz., test of significance, density estimation have been performed for identifying discriminating power of the features in between malignant and benign classes. A comparative study has been performed in respect to diagnostic measures viz., confusion matrix, sensitivity and specificity. Here we have considered two data sets from UCI machine learning database having nine and ten dimensional feature spaces for classification. Furthermore, the overall classification accuracy obtained by using the proposed classification strategy is 99.385% for dataset-I and 93.726% for dataset-II, respectively.     

基于支持向量机的软测量技术及其应用

支持向量机(SVM)是一种基于结构风险最小化原理,具有很好推广性能的学习算法。讨论了基于最小二乘支持向量机(LS-SVM)的软测量数据建模原理和方法,并将其应用在汽车排放的氮氧化合物NOX软测量中。通过与基于神经网络的软测量方法进行比较,结果显示出SVM的明显的优势,特别是对小样本、非线性、高维数一类软测量问题的建模,提供了一种有效的途径。     

Web-based algorithm for cylindricity evaluation using support vector machine learning

This paper introduces a cylindricity evaluation algorithm based on support vector machine learning with a specific kernel function, referred to as SVR, as a viable alternative to traditional least square method (LSQ) and non-linear programming algorithm (NLP). Using the theory of support vector machine regression, the proposed algorithm in this paper provides more robust evaluation in terms of CPU time and accuracy than NLP and this is supported by computational experiments. Interestingly, it has been shown that the SVR significantly outperforms LSQ in terms of the accuracy while it can evaluate the cylindricity in a more robust fashion than NLP when the variance of the data points increases. The robust nature of the proposed algorithm is expected because it converts the original nonlinear problem with nonlinear constraints into other nonlinear problem with linear constraints. In addition, the proposed algorithm is programmed using Java Runtime Environment to provide users with a Web based open source environment. In a real-world setting, this would provide manufacturers with an algorithm that can be trusted to give the correct answer rather than making a good part rejected because of inaccurate computational results.     

Combining flat and structured representations for fingerprint classification with recursive neural networks and support vector machines

We present new fingerprint classification algorithms based on two machine learning approaches: support vector machines (SVMs) and recursive neural networks (RNNs). RNNs are trained on a structured representation of the fingerprint image. They are also used to extract a set of distributed features of the fingerprint which can be integrated in the SVM. SVMs are combined with a new error-correcting code scheme. This approach has two main advantages: (a) It can tolerate the presence of ambiguous fingerprint images in the training set and (b) it can effectively identify the most difficult fingerprint images in the test set. By rejecting these images the accuracy of the system improves significantly. We report experiments on the fingerprint database NIST-4. Our best classification accuracy is of 95.6 percent at 20 percent rejection rate and is obtained by training SVMs on both FingerCode and RNN-extracted features. This result indicates the benefit of integrating global and structured representations and suggests that SVMs are a promising approach for fingerprint classification.     

Simultaneous feature selection and classification using kernel-penalized support vector machines

We introduce an embedded method that simultaneously selects relevant features during classifier construction by penalizing each feature’s use in the dual formulation of support vector machines (SVM). This approach called kernel-penalized SVM (KP-SVM) optimizes the shape of an anisotropic RBF Kernel eliminating features that have low relevance for the classifier. Additionally, KP-SVM employs an explicit stopping condition, avoiding the elimination of features that would negatively affect the classifier’s performance. We performed experiments on four real-world benchmark problems comparing our approach with well-known feature selection techniques. KP-SVM outperformed the alternative approaches and determined consistently fewer relevant features.     

支持向量机模型分类能力指标的统计分析

在支持向量机（support vector machines, SVM）中,如何衡量SVM的分类能力,最小化风险泛函是一个重要的指标。根据支持向量机小样本特点,给出了支持向量机分类能力的一个量化标准：最优超平面的可靠度β。详细讨论了β的下界和置信区间,并给出了在实际应用中,如何根据样本数据估计β的下界和置信区间。实验也证明了β的下界估计和置信区间的合理性、有效性。     

基于融合特征与支持向量机的控制图模式识别

为了提高控制图模式识别的精度, 将控制图模式的原始特征与形状特征相融合得到分类特征, 并采用支持向量机进行模式分类的控制图模式识别。融合所得特征既保持了控制图模式的原始特征所蕴涵的模式全局特性信息, 又通过引入形状特征对部分易混淆模式的局部几何特性进行强化, 使不同模式间的区分度得到有效提高; 而以支持向量机作为模式分类器保证方法在高维度特征和小样本条件下也能获得较好的识别性能。仿真实验结果表明所提方法的识别精度相比其他几种基于形状特征的控制图模式识别方法有明显提高。     

An extended one-versus-rest support vector machine for multi-label classification

Hybrid strategy, which generalizes a specific single-label algorithm while one or two data decomposition tricks are applied implicitly or explicitly, has become an effective and efficient tool to design and implement various multi-label classification algorithms. In this paper, we extend traditional binary support vector machine by introducing an approximate ranking loss as its empirical loss term to build a novel support vector machine for multi-label classification, resulting into a quadratic programming problem with different upper bounds of variables to characterize label correlation of individual instance. Further, our optimization problem can be solved via combining one-versus-rest data decomposition trick with modified binary support vector machine, which dramatically reduces computational cost. Experimental study on ten multi-label data sets illustrates that our method is a powerful candidate for multi-label classification, compared with four state-of-the-art multi-label classification approaches.     

最小二乘支持向量机和证据理论融合的体育视频分类

针对单一特征的体育视频分类的正确率低和稳定性差等缺陷,提出一种最小二乘支持向量机（LSSVM）和证据理论相融合的体育视频分类模型（DS-LSSVM）。提取颜色、纹理、亮度、运动矢量场等4种反映体育视频类别特征,将4种单特征的LSSVM初步分类结果作为独立证据构造基本概率指派,运用DS组合规则进行决策级融合,根据分类判决门限给出最终的体育视频分类结果,最后进行仿真实验。结果表明,DS-LSSVM的体育视频分类正确率高达97.90%,相对于参比模型,DS-LSSVM具有体育视频分类正确率高、稳定性好等优势。