一种基于近似支撑矢量机(PSVM)的交通目标分类方法

本文介绍了支撑向量机的特点,给出了实际应用中传统支撑矢量机存在的问题。为了克服支撑矢量机算法的不足,引入了一种近似支撑矢量机（PSVM）算法,并将此算法用于交通目标的分类识别。实验结果表明此算法比BP神经网络法准确率高,比传统的SVM法的效率高。     

Iterative support vector machine with guaranteed accuracy and run time

Abstract: Using a conjugate gradient method, a novel iterative support vector machine (FISVM) is proposed, which is capable of generating a new non‐linear classifier. We attempt to solve a modified primal problem of proximal support vector machine (PSVM) and show that the solution of the modified primal problem reduces to solving just a system of linear equations as opposed to a quadratic programming problem in SVM. This algorithm not only has no requirement for special optimization solvers, such as linear or quadratic programming tools, but also guarantees fast convergence. The full algorithm merely needs four lines of MATLAB codes, which gives results that are similar to or better than that of several new learning algorithms, in terms of classification accuracy. Besides, the proposed stand‐alone approach is capable of dealing with instability of classification performance of smooth support vector machine, generalized proximal support vector machine, PSVM and reduced support vector machine. Experiments carried out on UCI datasets show the effectiveness of our approach.     

医学影像库的一种智能分类方法

针对医学影像库信息量大、关联信息多、对象复杂的特点,将粗糙集算法与一种近似的支撑矢量机算法相结合实现了对医学影像库的正常、异常分类.粗糙集算法有效地降低了医学影像库的维度,而非线性的近似支撑矢量机算法则克服了标准支撑矢量机在实际应用中表现出来的算法速度慢、算法过于复杂而难于实现以及检测阶段运算量大等缺陷.实践证明了该方法的确具备简单、快速、高效的特点.     

A comparative study on classification of features by SVM and PSVM extracted using Morlet wavelet for fault diagnosis of spur bevel gear box

The condition of an inaccessible gear in an operating machine can be monitored using the vibration signal of the machine measured at some convenient location and further processed to unravel the significance of these signals. This paper deals with the effectiveness of wavelet-based features for fault diagnosis using support vector machines (SVM) and proximal support vector machines (PSVM). The statistical feature vectors from Morlet wavelet coefficients are classified using J48 algorithm and the predominant features were fed as input for training and testing SVM and PSVM and their relative efficiency in classifying the faults in the bevel gear box was compared.     

Performance analysis of support vector machines classifiers in breast cancer mammography recognition

Support vector machine (SVM) is a supervised machine learning approach that was recognized as a statistical learning apotheosis for the small-sample database. SVM has shown its excellent learning and generalization ability and has been extensively employed in many areas. This paper presents a performance analysis of six types of SVMs for the diagnosis of the classical Wisconsin breast cancer problem from a statistical point of view. The classification performance of standard SVM (St-SVM) is analyzed and compared with those of the other modified classifiers such as proximal support vector machine (PSVM) classifiers, Lagrangian support vector machines (LSVM), finite Newton method for Lagrangian support vector machine (NSVM), Linear programming support vector machines (LPSVM), and smooth support vector machine (SSVM). The experimental results reveal that these SVM classifiers achieve very fast, simple, and efficient breast cancer diagnosis. The training results indicated that LSVM has the lowest accuracy of 95.6107 %, while St-SVM performed better than other methods for all performance indices (accuracy = 97.71 %) and is closely followed by LPSVM (accuracy = 97.3282). However, in the validation phase, the overall accuracies of LPSVM achieved 97.1429 %, which was superior to LSVM (95.4286 %), SSVM (96.5714 %), PSVM (96 %), NSVM (96.5714 %), and St-SVM (94.86 %). Value of ROC and MCC for LPSVM achieved 0.9938 and 0.9369, respectively, which outperformed other classifiers. The results strongly suggest that LPSVM can aid in the diagnosis of breast cancer.     

增量密度加权近似支持向量机

近似支持向量机((PSVM)是一个正则化最小二乘问题,有解析解,但是它失去了支持向量机(SVM)的稀疏 性,使得所有的训练样例都成为支持向量。为了有效地控制近似支持向量机的稀疏性,提出了增量密度加权近似支持 向量机(mWPSVM),它在训练集中选取最基本的支持向量。实验表明,IvWPSVM方法与SVM, PSVM和DWPS- VM方法相比,其精度相似,收敛速度快,可有效地控制近似支持向量机的稀疏性。     

基于优化的支持向量机的机械设备多故障诊断模型

提出了一种基于遗传算法优化支持向量机的故障诊断模型.它利用遗传算法对支持向量机同时对传统的时域特征参量子集和核参数同时优化,以达到选择最优的设备故障主导特征参数组合的目的,实现对机器不同类型故障的识别.对齿轮故障诊断的结果表明它有效提高了多分类支持向量机的故障分类准确性.     

基于支持向量机的机械故障智能分类研究

故障样本不足是制约故障诊断技术向智能化方向发展的主要原因之一，支持向量机（SVM)是一种基于统计学习理论(SLT)的机器学习算法，它能在训练样本很少的情况下达到很好的分类效果，从而为故障诊断技术向智能化发展提供了新的途径．本文介绍了支持向量机分类算法，以滚动轴承的故障分类为例，探讨了该算法在故障诊断领域中的应用，并与BP神经网络分类方法进行了对比研究，结果表明，SVM方法在少样本情况下的分类效果优于BP神经网络分类方法．     

一种过程支持向量机及其在动态模式分类中的应用

针对一般SVM在机制上难以直接对动态模式进行分类的问题,提出了一种基于函数正交基展开的过程支持向量机.该模型的输入为时变函数,输出为模式类别.在输入函数空间中选择一组适当的正交函数基,将输入函数在该组函数基下进行有限项展开,把展开式系数作为核函数的输入.由于时变函数在基函数映射下与展开式系数一一对应,从而可利用SVM的变换机制实现动态模式分类.给出了基于SMO的求解算法,实验结果验证了模型和算法的有效性.     

改进粒子群算法优化支持向量机在故障诊断中的应用研究

支持向量机(SVM)作为当前新型的机器学习方式,凭借解决小样本问题、高维问题和局部极值问题等方面的优越性,在当前故障诊断方面有突出的表现;文章根据对支持向量机的研究,发现其在分类模型参数选择上存在困难,为此,提出利用改进粒子群算法优化的办法,解决粒子群前期收敛速度过快导致后期容易优化不均的现象;通过粒子群算法优化与支持向量机分类模型结合,以轴承故障检测和诊断为例,分析次方法的优越性和提高支持向量机在故障诊断过程中的精准度;通过实际检测得出,这种算法优化的方法改进的支持向量机对于聚类性较差的故障分类具有很好的诊断功能。     

基于超球和ASSRFOA的多生支持向量机

支持向量机(support vector machine, SVM)是一种基于结构风险最小化的机器学习方法, 能够有效解决分类问题. 但随着研究问题的复杂化, 现实的分类问题往往是多分类问题, 而SVM仅能用于处理二分类任务. 针对这个问题, 一对多策略的多生支持向量机(multiple birth support vector machine, MBSVM)能够以较低的复杂度实现多分类, 但缺点在于分类精度较低. 本文对MBSVM进行改进, 提出了一种新的SVM多分类算法: 基于超球(hypersphere)和自适应缩小步长果蝇优化算法(fruit fly optimization algorithm with adaptive step size reduction, ASSRFOA)的MBSVM, 简称HA-MBSVM. 通过拟合超球得到的信息, 先进行类别划分再构建分类器, 并引入约束距离调节因子来适当提高分类器的差异性, 同时采用ASSRFOA求解二次规划问题, HA-MBSVM可以更好地解决多分类问题. 我们采用6个数据集评估HA-MBSVM的性能, 实验结果表明HA-MBSVM的整体性能优于各对比算法.     

Linear models for cost‐sensitive classification

In this paper, we investigate the performance of statistical, mathematical programming and heuristic linear models for cost‐sensitive classification. In particular, we use five cost‐sensitive techniques including Fisher's discriminant analysis (DA), asymmetric misclassification cost mixed integer programming (AMC‐MIP), cost‐sensitive support vector machine (CS‐SVM), a hybrid support vector machine and mixed integer programming (SVMIP) and heuristic cost‐sensitive genetic algorithm (CGA) techniques. Using simulated datasets of varying group overlaps, data distributions and class biases, and real‐world datasets from financial and medical domains, we compare the performances of our five techniques based on overall holdout sample misclassification cost. The results of our experiments on simulated datasets indicate that when group overlap is low and data distribution is exponential, DA appears to provide superior performance. For all other situations with simulated datasets, CS‐SVM provides superior performance. In case of real‐world datasets from financial domain, CGA and AMC‐MIP hold a slight edge over the two SVM‐based classifiers. However, for medical domains with mixed continuous and discrete attributes, SVM classifiers perform better than heuristic (CGA) and AMC‐MIP classifiers. The SVMIP model is the most computationally inefficient model and poor performing model.     

Multicategory Proximal Support Vector Machine Classifiers

Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal support vector machines and related approaches (Fung & Mangasarian, 2001; Suykens & Vandewalle, 1999) can be interpreted as ridge regression applied to classification problems (Evgeniou, Pontil, & Poggio, 2000). Extensive computational results have shown the effectiveness of PSVM for two-class classification problems where the separating plane is constructed in time that can be as little as two orders of magnitude shorter than that of conventional support vector machines. When PSVM is applied to problems with more than two classes, the well known one-from-the-rest approach is a natural choice in order to take advantage of its fast performance. However, there is a drawback associated with this one-from-the-rest approach. The resulting two-class problems are often very unbalanced, leading in some cases to poor performance. We propose balancing the k classes and a novel Newton refinement modification to PSVM in order to deal with this problem. Computational results indicate that these two modifications preserve the speed of PSVM while often leading to significant test set improvement over a plain PSVM one-from-the-rest application. The modified approach is considerably faster than other one-from-the-rest methods that use conventional SVM formulations, while still giving comparable test set correctness.Editor Shai Ben-David     

基于边界近邻的最小二乘支持向量机实现

最小二乘支持向量机采用最小二乘线性系统代替传统的支持向量即采用二次规划方法解决模式识别问题,能够有效地减少计算的复杂性。但最小二乘支持向量机失去了对支持向量的稀疏性。文中提出了一种基于边界近邻的最小二乘支持向量机,采用寻找边界近邻的方法对训练样本进行修剪,以减少了支持向量的数目。将边界近邻最小二乘支持向量机用来解决由1-a-r(one-against-rest)方法构造的支持向量机分类问题,有效地克服了用1-a-r(one-against-rest)方法构造的支持向量机分类器训练速度慢、计算资源需求比较大、存在拒分区域等缺点。实验结果表明,采用边界近邻最小二乘支持向量机分类器,识别精度和识别速度都得到了提高。     

基于原型超平面的多类最接近支持向量机

基于广义特征值的最接近支持向量机（proximal support vector machine via generalized eigenvalues,GEPSVM）摒弃了传统意义下支持向量机典型平面的平行约束,代之以通过优化使每类原型平面尽可能接近本类样本,同时尽可能远离它类样本的准则来解析获得原型平面;从而避免了SVM的二次规划,其分类性能达到甚至超过了SVM．但GEPSVM仍存在如下不足：①仅对两分类问题而提出,无法直接求解多分类问题;②存在正则化因子的选择问题;③求解原型平面的广义特征值问题中所涉及的矩阵一般仅为半正定,容易导致奇异性问题．通过定义新的准则,构建了一个能直接求解多个原型超平面的多分类方法,称之为基于原型超平面的多类最接近支持向量机,较之GEPSVM,该方法优势在于：①无正则化因子选择的困扰;②可同时求解多个超平面,对两分类问题,分类性能达到甚至优于GEPSVM;③超平面的选择问题转化为简单特征值而非广义特征值求解问题;④原型平面的选择只依赖于本类样本,故不必考虑多分类情形时的数据不平衡问题．     

A comparative study for content-based dynamic spam classification using four machine learning algorithms

The growth of email users has resulted in the dramatic increasing of the spam emails during the past few years. In this paper, four machine learning algorithms, which are Naïve Bayesian (NB), neural network (NN), support vector machine (SVM) and relevance vector machine (RVM), are proposed for spam classification. An empirical evaluation for them on the benchmark spam filtering corpora is presented. The experiments are performed based on different training set size and extracted feature size. Experimental results show that NN classifier is unsuitable for using alone as a spam rejection tool. Generally, the performances of SVM and RVM classifiers are obviously superior to NB classifier. Compared with SVM, RVM is shown to provide the similar classification result with less relevance vectors and much faster testing time. Despite the slower learning procedure, RVM is more suitable than SVM for spam classification in terms of the applications that require low complexity.     

基于几何分析的支持向量机快速训练与分类算法

当支持向量机中存在相互混叠的海量训练样本时,不但支持向量求取困难,且支持向量数目巨大,这两个问题已成为限制其应用的瓶颈问题。该文通过对支持向量几何意义的分析,首先研究了支持向量的分布特性,并提出了基于几何分析的支持向量机快速算法,该算法首先从训练样本中选择出部分近邻向量,然后在进行混叠度分析的基础上,选择真实的边界向量样本子空间用来代替全部训练集,这样既大大减少了训练样本数目,同时去除了混叠严重的奇异样本的影响,并大大减少了支持向量的数目。实验结果表明:该算法在不影响分类性能的条件下,可以加快支持向量机的训练速度和分类速度。     

基于小波变换和支持向量机的模拟电路故障诊断方法研究

提出一种利用小波变换提取模拟电路故障特征和基于支持向量机状态分类的模拟电路故障自动识别和诊断方法。首先讨论小波变换的基本原理和支持向量机原理及其多分类算法,同时着重研究支持向量机的一种改进型一对多故障分类算法,然后实现在小波变换上,采用分布式多SVM分类器识别单相桥式整流模拟电路的故障。实验证明,该方法能准确有效地对模拟电路故障进行识别和诊断。     

基于支持向量机的电路故障诊断模型

提出了一种基于遗传编程和支持向量机的故障诊断模型。通过遗传编程对时域指标进行特征选择和提取，得到更能反映信号本质的特征信号，该特征信号可作为识别特征输入多类支持向量机，实现对模拟电路不同类型软故障的识别。实验结果表明，同传统时域指标相比，经过遗传选择和提取的特征对模拟电路的软故障具有更好的识别能力，进而提高了多类支持向量机的分类准确性。     

基于粗糙集与支持向量机的故障智能分类方法

结合粗糙集的属性约简与支持向量机的分类功能,提出一种应用粗糙集与支持向量机的故障分类方法。该方法应用粗糙集理论属性约简作为诊断数据预处理器,可将冗余属性从诊断决策表中删除,而不损失有效信息,然后基于支持向量机进行故障分类建模和预测。谊方法可降低故障诊断数据维数及支持向量机在故障分类过程中的复杂度,但不会降低分类性能。将方法应用于某柴油机故障诊断数据的测试分类,结果表明该方法可快速正确的从数据获得故障类剐。