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

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

一种滚动轴承故障诊断方法

针对基于支持向量机的滚动轴承故障诊断方法中支持向量机的参数优化问题,提出一种改进的果蝇优化算法,即以模式分类准确率作为果蝇味道浓度函数,并采用该算法来优化支持向量机模型的惩罚因子和核函数参数;基于改进果蝇优化算法和支持向量机对滚动轴承的故障模式进行分类诊断,结果表明改进的果蝇优化算法具有较高的收敛速度和寻优效率,基于该算法和支持向量机的滚动轴承故障诊断方法具有较高的分类准确率。     

基于极限学习机的船舶柴油机故障诊断

针对传统深度核极限学习机网络仅利用端层特征进行分类导致特征不全面，以及故障诊断分类器中核函数选择不恰当等问题，提出基于多层特征表达和多核极限学习机的船舶柴油机故障诊断方法。利用深度极限学习机网络提取故障数据的多层特征；将提取出的各层特征级联为一个具有多属性特征的故障数据特征向量；使用多核极限学习机分类器准确地实现柴油机的故障诊断。在标准分类数据集和船舶柴油机仿真故障数据集上的实验结果表明，与其他极限学习机算法相比，该方法能够有效提高故障诊断的准确率和稳定性，且具有较好的泛化性能，是柴油机故障诊断一个更为优秀实用的工具。     

基于基因表达式编程的核k近邻分类算法

核k近邻分类算法在生物信息学和蛋白质结构预测等领域中的应用受到人们极大的关注.核函数在核k近邻分类算法的分类性能中起着重要的作用,如果核函数及其参数选择得当,则将获得较高的分类准确率.为了自动产生合适的核函数,提高分类的准确率,提出了一种基于基因表达式编程的核k近邻分类算法GEPKNN.该算法的基本思想是用基因表达式编程搜索与训练数据相关的核函数及其参数,在进化过程中用k折交叉验证评估个体的适应度.该算法克服了核k近邻算法的主观性和不确定性,能自动产生合适的核函数并提高分类的准确率.     

基于DCCA-IWO-MKSVM的模拟电路故障诊断方法

为了提高模拟电路故障的诊断效果,提出基于DCCA-IWO-MKSVM的模拟电路故障诊断方法。采用DCCA算法对模拟电路的故障特征进行提取,构造新的融合特征。对支持向量机的核函数进行线性组合构造新的多核函数,并用IWO算法对其参数进行优化,以构建最优故障诊断模型,用于融合特征的学习分类。故障诊断实验结果表明:对于融合特征的故障诊断效率,该算法要优于单核函数的IWO-SVM算法,且整个故障诊断系统的诊断效果具有较高的准确率。     

基于粒子群算法和支持向量机的故障诊断研究

支持向量机是采用结构风险最小化原则代替传统统计学中的基于大样本的经验风险最小化原则的新型机器学习方法,具有出色的学习分类能力和推广能力,广泛地应用于模式识别和函数拟合中;支持向量机中核函数的参数选择非常重要,它决定着故障诊断的精确度;为了提高电气设备故障诊断的精度和效率,将粒子群优化算法和最小二乘支持向量机相结合,提出了一种基于粒子群支持向量机的故障诊断方法,能够实现对核函数的σ参数进行快速动态选取,提高故障诊断的准确率和效率;实验表明,该方法能够有效地找出合适的核参数,并能取得较好的分类效果。     

一种入侵检测的分类方法研究

针对传统的入侵检测算法精度低,结果稳定性差的问题,提出了一种基于构造性核函数覆盖聚类和最大化最小概率机器回归方法的入侵检测算法。首先,利用核函数覆盖将原空间的待分类样本映射到一个高维的特征空间中,使得样本变得线性可分;然后通过控制错分率实现分类的最大化,并利用最大最小概率机的高维映射泛化特性,实现了不同核函数下的数据多维分类问题。实验结果证明,该算法具有分类准确率高、稳定性好的特点。     

基于共享最近邻聚类和模糊集理论的分类器

提出一种基于共享最近邻聚类和模糊集理论的分类器．首先，在提出与核点密切相关的核半径概念的基础上，应用共享最近邻聚类得到正常类空间的部分核点和核半径，建立求解正常类空间补充核点的多目标优化模型，从而获得刻画正常类空间的全部核点和核半径．然后，将模糊集理论引入正常类的类属划分中，利用核点和核半径定义正常类的隶属度函数，建立基于隶属度函数的分类函数或分类器．实验表明，该分类器能处理包含噪音、孤立点和不规则子类的高维数据集的分类问题．     

PCA特征抽取与SVM多类分类在传感器故障诊断中的应用

为了提高传感器故障诊断的准确率,提出了基于主元分析(PCA)特征抽取和支持向量机(SVM)多类分类的故障诊断方法.该方法通过对传感器输出信号进行小波包分解产生原始特征数据,然后采用PCA特征抽取得到二次特征向量,增强传感器各个状态模式的可分性.二次特征输入到二叉树SVM多类分类算法设计的分类器实现传感器故障诊断.仿真实验结果表明,这种结合了PCA特征抽取和SVM分类的诊断方法准确率高,其诊断效果优于直接采用原始特征进行分类的情况.     

基于结构与文本关键词相关度的XML网页分类研究

针对XML网页特点，提出了计算XML文档结构相似性、文档关键词出现的位置以及关键词频度的方法，根据计算的结果提取XML网页特征，同时设计了一种基于支持向量机的XML网页多类分类算法．算法通过XML文档的训练样本集为每一类文档建立基于相似公共特征的聚类核，计算测试样本中的文档与每个聚类核的相似度，判断该文档的所属类．实验证明该分类算法具有比较高的分类查全率和查准率，能够较好地解决XML文档同时属于多个类的问题．     

An enhanced Support Vector Machine classification framework by using Euclidean distance function for text document categorization

This paper presents the implementation of a new text document classification framework that uses the Support Vector Machine (SVM) approach in the training phase and the Euclidean distance function in the classification phase, coined as Euclidean-SVM. The SVM constructs a classifier by generating a decision surface, namely the optimal separating hyper-plane, to partition different categories of data points in the vector space. The concept of the optimal separating hyper-plane can be generalized for the non-linearly separable cases by introducing kernel functions to map the data points from the input space into a high dimensional feature space so that they could be separated by a linear hyper-plane. This characteristic causes the implementation of different kernel functions to have a high impact on the classification accuracy of the SVM. Other than the kernel functions, the value of soft margin parameter, C is another critical component in determining the performance of the SVM classifier. Hence, one of the critical problems of the conventional SVM classification framework is the necessity of determining the appropriate kernel function and the appropriate value of parameter C for different datasets of varying characteristics, in order to guarantee high accuracy of the classifier. In this paper, we introduce a distance measurement technique, using the Euclidean distance function to replace the optimal separating hyper-plane as the classification decision making function in the SVM. In our approach, the support vectors for each category are identified from the training data points during training phase using the SVM. In the classification phase, when a new data point is mapped into the original vector space, the average distances between the new data point and the support vectors from different categories are measured using the Euclidean distance function. The classification decision is made based on the category of support vectors which has the lowest average distance with the new data point, and this makes the classification decision irrespective of the efficacy of hyper-plane formed by applying the particular kernel function and soft margin parameter. We tested our proposed framework using several text datasets. The experimental results show that this approach makes the accuracy of the Euclidean-SVM text classifier to have a low impact on the implementation of kernel functions and soft margin parameter C.     

Parallel multitask cross validation for Support Vector Machine using GPU

The Support Vector Machine (SVM) is an efficient tool in machine learning with high accuracy performance. However, in order to achieve the highest accuracy performance, n-fold cross validation is commonly used to identify the best hyperparameters for SVM. This becomes a weak point of SVM due to the extremely long training time for various hyperparameters of different kernel functions. In this paper, a novel parallel SVM training implementation is proposed to accelerate the cross validation procedure by running multiple training tasks simultaneously on a Graphics Processing Unit (GPU). All of these tasks with different hyperparameters share the same cache memory which stores the kernel matrix of the support vectors. Therefore, this heavily reduces redundant computations of kernel values across different training tasks. Considering that the computations of kernel values are the most time consuming operations in SVM training, the total time cost of the cross validation procedure decreases significantly. The experimental tests indicate that the time cost for the multitask cross validation training is very close to the time cost of the slowest task trained alone. Comparison tests have shown that the proposed method is 10 to 100 times faster compared to the state of the art LIBSVM tool.     

Evolutionary strategies for hyperparameters of support vector machines based on multi-scale radial basis function kernels

Kernel functions are used in support vector machines (SVM) to compute inner product in a higher dimensional feature space. SVM classification performance depends on the chosen kernel. The radial basis function (RBF) kernel is a distance-based kernel that has been successfully applied in many tasks. This paper focuses on improving the accuracy of SVM by proposing a non-linear combination of multiple RBF kernels to obtain more flexible kernel functions. Multi-scale RBF kernels are weighted and combined. The proposed kernel allows better discrimination in the feature space. This new kernel is proved to be a Mercer’s kernel. Furthermore, evolutionary strategies (ESs) are used for adjusting the hyperparameters of SVM. Training accuracy, the bound of generalization error, and subset cross-validation on training accuracy are considered to be objective functions in the evolutionary process. The experimental results show that the accuracy of multi-scale RBF kernels is better than that of a single RBF kernel. Moreover, the subset cross-validation on training accuracy is more suitable and it yields the good results on benchmark datasets.     

基于多种核函数的SVM在垃圾邮件过滤中的应用

采用TF-IDF和Bernoulli两种模型构造邮件向量,首先详细测试了CHI降维策略对线性支持向量机进行邮件分类的影响。将基于核函数的支持向量机引入到垃圾邮件过滤中,对基于线性核、多项式核和径向基核的支持向量机在邮件分类中的准确率和训练时间进行了比较,分析了训练样本不平衡对分类的影响,并从理论上对实验结果进行了分析,实验结果证明基于径向基核函数的SVM分类器对垃圾邮件有较好的过滤效果。     

Automatic detection of erythemato-squamous diseases using PSO–SVM based on association rules

In this paper, we develop a diagnosis model based on particle swarm optimization (PSO), support vector machines (SVMs) and association rules (ARs) to diagnose erythemato-squamous diseases. The proposed model consists of two stages: first, AR is used to select the optimal feature subset from the original feature set; then a PSO based approach for parameter determination of SVM is developed to find the best parameters of kernel function (based on the fact that kernel parameter setting in the SVM training procedure significantly influences the classification accuracy, and PSO is a promising tool for global searching). Experimental results show that the proposed AR_PSO–SVM model achieves 98.91% classification accuracy using 24 features of the erythemato-squamous diseases dataset taken from UCI (University of California at Irvine) machine learning database. Therefore, we can conclude that our proposed method is very promising compared to the previously reported results.     

基于混沌粒子群算法和小波SVM的P2P流量识别方法

针对对等网络(Peer-to-Peer,P2P)流量具有的多尺度和突变性等问题,提出了基于小波核函数的支持向量机(Support Vector Machine,SVM)的P2P流量识别算法。进一步,对常用的SVM参数训练方法训练时间过长和易陷入局部极优值等缺陷进行分析,使用混沌粒子群算法对SVM参数进行优化以提高参数训练效率和识别准确率。最后利用真实的校园网网络流量数据对所提方法的有效性进行测试,结果表明,相对于使用传统核函数和参数训练方法的支持向量机P2P流量识别方法,所提方法具有更高的P2P流量识别正确率和计算效率。     

基于近邻边缘检测的支持向量机

针对标准支持向量机方法需要存储、计算和处理核矩阵而学习效率很低,不能有效处理较大规模数据挖掘的问题,提出一种基于近邻边缘检测的支持向量机方法 (SVM Method Based on Neighbor Edge Detection, ED_SVM)。该方法将近邻边缘检测技术引入SVM的训练过程,即首先对数据进行划分,选择混合类样本,通过边缘检测技术提取其中位于近似最优分类边界附近的含有较多重要支持向量信息的样本,构成新的小规模训练集,以在压缩训练集的同时保持原始支持向量信息的分布特性;并在新构成的训练集上训练标准SVM,在提高SVM学习效率的同时得到优秀的泛化性能。实验结果表明,本文提出的ED_SVM方法能够同时获得较高的测试精度和学习效率。     

应用于垃圾邮件过滤的词序列核

针对支持向量机(SVM)中常用核函数由于忽略文本结构而导致大量语义信息丢失的现象,提出一种类别相关度量的词序列核(WSK),并将其应用于垃圾邮件过滤。首先提取邮件文本特征并计算特征的类别相关度量,然后利用词序列核作为核函数训练支持向量机,训练过程中利用类别相关度量计算词的衰减系数,最后对邮件进行分类。实验结果表明,与常用核函数和字符串核相比,改进的词序列核分类准确率更高,提高了垃圾邮件过滤的准确率。     

Motor Imagery Electroencephalograph Classification Based on Optimized Support Vector Machine by Magnetic Bacteria Optimization Algorithm

In this paper, an optimized support vector machine (SVM) based on a new bio-inspired method called magnetic bacteria optimization algorithm method is proposed to construct a high performance classifier for motor imagery electroencephalograph based brain–computer interface (BCI). Butterworth band-pass filter and artifact removal technique are combined to extract the feature of frequency band of the ERD/ERS. Common spatial pattern is used to extract the feature vector which are put into the classifier later. The optimization mechanism involves kernel parameters setting in the SVM training procedure, which significantly influences the classification accuracy. Our novel approach aims to optimize the penalty factor parameter C and kernel parameter g of the SVM. The experimental results on the BCI Competition IV dataset II-a clearly present the effectiveness of the proposed method outperforming other competing methods in the literature such as genetic algorithm, particle swarm algorithm, artificial bee colony, biogeography based optimization.     

一种基于样本加权的多尺度核支持向量机方法

多核学习方法是机器学习领域中的一个新的热点。核方法通过将数据映射到高维空间来增加线性分类器的计算能力,是目前解决非线性模式分析与分类问题的一种有效途径。但是在一些复杂的情况下,单个核函数构成的核学习方法并不能完全满足如数据异构或者不规则、样本规模大、样本分布不平坦等实际应用中的需求问题,因此将多个核函数进行组合以期获得更好的结果,是一种必然的发展趋势。因此提出一种基于样本加权的多尺度核支持向量机方法,通过不同尺度核函数对样本的拟合能力进行加权,从而得到基于样本加权的多尺度核支持向量机决策函数。通过在多个数据集上的实验分析可以得出所提方法对于各个数据集都获得了很高的分类准确率。