基于W_2~1再生核支持向量机的模式分类研究

支持向量机是基于统计学习理论的模式分类器。它通过结构风险最小化准则和核函数方法,较好地解决了模式分类器复杂性和推广性之间的矛盾,引起了大家对模式识别领域的极大关注。近年来,支持向量机在手写体识别、人脸识别、文本分类等领域取得了很大的成功。文章将一种新的核函数用于虹膜识别,并与传统的多项式核函数、高斯核函数进行了比较。初步结果显示了该核函数的应用潜力。     

基于W12再生核支持向量机的模式分类研究

支持向量机是基于统计学习理论的模式分类器.它通过结构风险最小化准则和核函数方法,较好地解决了模式分类器复杂性和推广性之间的矛盾,引起了大家对模式识别领域的极大关注.近年来,支持向量机在手写体识别、人脸识别、文本分类等领域取得了很大的成功.文章将一种新的核函数用于虹膜识别,并与传统的多项式核函数、高斯核函数进行了比较.初步结果显示了该核函数的应用潜力.     

相关向量机在车型识别中的应用研究

相关向量机是一种稀疏的贝叶斯学习算法,对非线性、高维数的小样本问题有非常好的分类效果和学习推广能力.而且使用较少的核函数,研究了用相关向量机技术进行车型识别,设计了基于相关向量机的车型分类器.实验结果表明,基于相关向量机的车型分类器不仅具有基于支持向量机的车型分类器的相同性能,而且比支持向量机使用更少的核函数,实验取得了较好的分类效果.     

基于支持向量机的纹理识别方法研究

支持向量机是基于统计学习理论的模式分类器。它通过结构风险最小化准则和核函数方法,可以自动寻找那些对分类有较好区分能力的支持向量,由此构造出的分类器可以最大化类与类的间隔,具有较好的推广性能和较高的分类准确率,研究了将支持向量机理论用于纹理分类识别的方法,实验结果表明,该方法比传统的基于BP神经网络的识别方法识别准确率高。     

多类分类预选取的SVM在语音识别中的应用

支持向量机在训练过程中,将很多时间都浪费在对非支持向量的复杂计算上,特别是对于大规模数据量的语音识别系统来说,支持向量机在训练时间上不必要的开销将会更加显著。核模糊C均值聚类是一种常用的典型动态聚类算法,并且有核函数能够把模式空间的数据非线性映射到高维特征空间。在核模糊C均值聚类的基础上,结合了多类分类支持向量机中的一对一方法,按照既定的准则把训练样本集中有可能属于支持向量的样本数据进行预选取,并应用到语音识别中。实验取得了较好的结果,该方法有效地提高了支持向量机分类器的学习效率和泛化能力。     

基于支持向量机的控制图模式识别

为了提高控制图模式识别效果，提出混合核函数支持向量机的模式识别方法。在模型构造中采用一对一多类分类支持向量机，并利用遗传算法优化混合核函数支持向量机参数。仿真和应用结果表明，混合核函数支持向量机对各种模式控制图的总体识别率，I型错判均优于单独核函数、概率神经网络和小波概率神经网络，且具有良好的泛化能力，适合生产现场实时在线工序质量控制。     

基于混合核函数的脱机手写汉字识别

脱机手写汉字识别是模式识别领域一项难题.支持向量机(SVM)也是近年来发展起来并成功的用于模式分类的新型机器学习方法,由训练集和核函数完全刻画.其中核函数的选择决定了支持向量机的性能,由于普通核函数各有其利弊,为了得到学习能力和泛化性能都很强的核函数来吸收手写汉字的变形,采用混合核函数,并运用于手写体汉字分类.实验结果表明混合核函数对手写体汉字的分类识别率要高于由普通单个核函数构造的支持向量机.     

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

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

脱机手写体汉字识别中SVM参数优选问题

研究了基于支持向量机的脱机手写体汉字识别中核参数和误差惩罚因子的选择问题.将遗传算法跟支持向量机相结合,提出了一种自动优选支持向量机模型参数的方法,减少了以往应用支持向量机需反复试验以确定其参数的人工工作量.采用高斯核函数的支持向量机分类器进行实验,识别率达到97.83%,验证了该方法的有效性.     

支持向量机模型与应用综述

依据支持向量机的发展引用多篇基于不同领域应用的文献,包括文本识别、人体部位、车辆交通、医疗检测及其他领域.同时从核函数方法的原理和贴合实际数据集的多分类方法两方面详细阐述支持向量机的理论基础和发展历程.研究表明,支持向量机技术改进和应用的发展空间是无限的,识别分类技术的前景是广阔的.     

Kernel selection in multi-class support vector machines and its consequence to the number of ties in majority voting method

Support vector machines are a relatively new classification method which has nowadays established a firm foothold in the area of machine learning. It has been applied to numerous targets of applications. Automated taxa identification of benthic macroinvertebrates has got generally very little attention and especially using a support vector machine in it. In this paper we investigate how the changing of a kernel function in an SVM classifier effects classification results. A novel question is how the changing of a kernel function effects the number of ties in a majority voting method when we are dealing with a multi-class case. We repeated the classification tests with two different feature sets. Using SVM, we present accurate classification results proposing that SVM suits well to the automated taxa identification of benthic macroinvertebrates. We also present that the selection of a kernel has a great effect on the number of ties.     

A combination of CSP-based method with soft margin SVM classifier and generalized RBF kernel for imagery-based brain computer interface applications

Several methods utilizing common spatial pattern (CSP) algorithm have been presented for improving the identification of imagery movement patterns for brain computer interface applications. The present study focuses on improving a CSP-based algorithm for detecting the motor imagery movement patterns. A discriminative filter bank of CSP method using a discriminative sensitive learning vector quantization (DFBCSP-DSLVQ) system is implemented. Four algorithms are then combined to form three methods for improving the efficiency of the DFBCSP-DSLVQ method, namely the kernel linear discriminant analysis (KLDA), the kernel principal component analysis (KPCA), the soft margin support vector machine (SSVM) classifier and the generalized radial bases functions (GRBF) kernel. The GRBF is used as a kernel for the KLDA, the KPCA feature selection algorithms and the SSVM classifier. In addition, three types of classifiers, namely K-nearest neighbor (K-NN), neural network (NN) and traditional support vector machine (SVM), are employed to evaluate the efficiency of the classifiers. Results show that the best algorithm is the combination of the DFBCSP-DSLVQ method using the SSVM classifier with GRBF kernel (SSVM-GRBF), in which the best average accuracy, attained are 92.70% and 83.21%, respectively. Results of the Repeated Measures ANOVA shows the statistically significant dominance of this method at p <?0.05. The presented algorithms are then compared with the base algorithm of this study i.e. the DFBCSP-DSLVQ with the SVM-RBF classifier. It is concluded that the algorithms, which are based on the SSVM-GRBF classifier and the KLDA with the SSVM-GRBF classifiers give sufficient accuracy and reliable results.

     

Support vector learning for fuzzy rule-based classification systems

To design a fuzzy rule-based classification system (fuzzy classifier) with good generalization ability in a high dimensional feature space has been an active research topic for a long time. As a powerful machine learning approach for pattern recognition problems, the support vector machine (SVM) is known to have good generalization ability. More importantly, an SVM can work very well on a high- (or even infinite) dimensional feature space. This paper investigates the connection between fuzzy classifiers and kernel machines, establishes a link between fuzzy rules and kernels, and proposes a learning algorithm for fuzzy classifiers. We first show that a fuzzy classifier implicitly defines a translation invariant kernel under the assumption that all membership functions associated with the same input variable are generated from location transformation of a reference function. Fuzzy inference on the IF-part of a fuzzy rule can be viewed as evaluating the kernel function. The kernel function is then proven to be a Mercer kernel if the reference functions meet a certain spectral requirement. The corresponding fuzzy classifier is named positive definite fuzzy classifier (PDFC). A PDFC can be built from the given training samples based on a support vector learning approach with the IF-part fuzzy rules given by the support vectors. Since the learning process minimizes an upper bound on the expected risk (expected prediction error) instead of the empirical risk (training error), the resulting PDFC usually has good generalization. Moreover, because of the sparsity properties of the SVMs, the number of fuzzy rules is irrelevant to the dimension of input space. In this sense, we avoid the "curse of dimensionality." Finally, PDFCs with different reference functions are constructed using the support vector learning approach. The performance of the PDFCs is illustrated by extensive experimental results. Comparisons with other methods are also provided.     

Wavelet support vector machine

An admissible support vector (SV) kernel (the wavelet kernel), by which we can construct a wavelet support vector machine (SVM), is presented. The wavelet kernel is a kind of multidimensional wavelet function that can approximate arbitrary nonlinear functions. The existence of wavelet kernels is proven by results of theoretic analysis. Computer simulations show the feasibility and validity of wavelet support vector machines (WSVMs) in regression and pattern recognition.     

支持向量机及其在草图编辑手势识别中的应用

支持向量机(SVM)是一种基于统计学习理论的机器学习与模式识别方法。它通过结构风险最小化准则和核函数方法,较好地解决了小样本、非线性及高维模式识别问题。本文主要从联机手绘草图编辑的角度出发,谈谈支持向量机在草绘手势笔划识别中的具体应用。     

基于LSSVM的静态手势识别

支持向量机(Support Vector Machine，简称SVM)，是基于统计学习理论的一种新的模式识别方法，较好地解决了小样本学习问题。通过使非线性空间变换为线性空间，降低了算法的复杂性。LSSVM(Least Squares Support Vector Machine)由于使用线性等式代替了标准的SVM算法中的线性不等式，进一步降低了运算量。利用傅立叶描述子获取静态手势特征向量，通过LSSVM大尺度算法求解方程组来得到LSSVM分类器，进行静态手势识别，取得了较高的识别率。说明如何把静态手势识别结果应用到机器人远程控制中，提高人机交互的友好性。     

基于支持向量机的激光焊接过程的非线性辨识

针对激光焊接过程非线性系统建模困难的问题,研究基于支持向量机的非线性系统回归建模方法.支持向量机由核函数与训练集完全刻画,进一步提高支持向量机性能的关键是针对给定的系统设计恰当的核函数.用改进的核函数,对具有典型非线性特性的焊接过程进行辨识.仿真结果验证了该方法的有效性.     

一种基于morlet小波核的约简支持向量机

针对支持向量机（SVM）的训练数据量仅局限于较小样本集的问题，结合Morlet小波核函数，提出了一种基于Morlet小波核的约倚支持向量机（MWRSVM—DC）．算法的核心是通过密度聚类寻找聚类中每个簇的边缘点作为约倚集合，并利用该约倚集合寻找支持向量．实验表明，利用小波核，该算法不仅提高了分类的准确率，而且提高了整体分类效率．