快速的支持向量机多类分类研究

研究了支持向量机多类算法DAGSVM（Direct Acyclic Graph SVM）的速度优势,提出了结合DAGSVM和简化支持向量技术的一种快速支持向量机多类分类方法。该方法一方面减少了一次分类所需的两类支持向量机的数量,另一方面减少了支持向量的数量。实验采用UCI和Statlog数据库的多类数据,并和四种多类方法进行比较,结果表明该方法能有效地加快分类速度。     

一种改进的DAGSVM 手势识别方法及其应用

在支持向量机多分类方法基础上,提出了一种改进的有向无环图支持向量机( Directed Acyclic Graph Support Vector Machine,DAGSVM) 手势识别方法。首先根据Kinect 采集到 的场景深度信息将前景和背景分开,分割得到手,然后提取其特征向量,利用特征向量训练多 个SVM 两分类器,采用DAG 拓扑结构构成DAGSVM 多分类器,并对其结构排序进行改进。 实验证明,与其他支持向量机多分类方法相比,改进后的DAGSVM 分类器能够达到更高的识 别率,并将这个手势识别方法用于智能轮椅的控制上,收到了良好的效果。     

实现兼类样本增量学习的一种算法

针对兼类样本,提出一种增量学习算法.利用超球支持向量机,在特征空间对属于同一类别的样本求得一个能包围该类尽可能多样本的最小超球,使各类样本之间通过超球隔开.增量学习过程中,只对新增样本以及与新增样本具有相同兼类的旧样本集中的支持向量进行训练,且每次训练只针对一类样本,使得算法在很小的样本集、很小的空间代价下实现兼类样本增量学习,同时保留了与新增样本类别无关的历史训练结果.分类过程中,通过计算待分类样本到各超球球心的距离判定其所属类别,分类准确快捷.实验结果证明了该算法的有效性.     

实现兼类样本类增量学习的一种算法

针对兼类样本,提出一种类增量学习算法.利用超球支持向量机,对每类样本求得一个能包围该类尽可能多样本的最小超球,使各类样本之间通过超球隔开.增量学习时,对新增样本以及旧样本集中的支持向量和超球附近的非支持向量进行训练,使得算法在很小的空闻代价下实现兼类样本类增量学习.分类过程中,根据待分类样本到各超球球心的距离判定其所属类别.实验结果表明,该算法具有较快的训练、分类速度和较高的分类精度.     

去边缘模糊支持向量机

针对两类分类问题中样本点数量多,类别模糊且有孤立野点的情况,提出了去边缘模糊支持向量机。该方法用一类分类思想,预先去掉那些可能不是支持向量的点,并引入了模糊隶属度计算公式,使其适合模糊分类的性能特点。从理论和实证分析两个方面将该方法与一般的模糊支持向量机进行了对比分析,结果显示该方法不但大大减少了训练点数目,从而减少了内存和计算量,提高了训练速度和分类准确率。     

多类别模糊补偿支持向量机新模型研究

提出了一种更一般化描述的多类别模糊补偿支持向量机(M-FSVM)算法,用它来解决经典支持向量机对类别分类误差的不均衡性问题。并在开源代码LibSVM的基础上实现了新算法,并应用于网络入侵检测。实验结果表明训练样本数目少的类别的分类精度得到了提高。     

一种改进的DDAGSVM多类分类方法

支持向量机最初是针对两类分类问题提出的,如何有效地将其推广到多类分类问题仍是一项有待研究的课题。本文介绍了现有的具有代表性的多类支持向量机分类算法,并在分析决策导向非循环图支持向量机分类器生成顺序随机化的基础上,引入类内的分散度,以基于样本分布的类间分离程度作为类别的划分顺序,最终构成了一种分类间隔较大的决策导向非循环图支持向量机分类算法。实验结果表明了本文方法具有更高的分类精度。     

基于超球支持向量机的兼类文本分类算法研究

针对兼类文本,提出了一种分类算法。对属于同一类别的文本,利用超球支持向量机在特征空间中求得一个能包围该类尽可能多文本的最小超球,使各类文本之间通过超球分隔开,达到分类效果。对待分类文本,计算它到各超球球心的距离,根据距离判定该文本所属的类别。实验结果证明,该算法不仅具有较快的分类速度,而且具有较高的分类精度。     

实现兼类样本类增量学习的一种算法

针对兼类样本,提出一种类增量学习算法.利用超球支持向量机,对每类样本求得一个能包围该类尽可能多样本的最小超球,使各类样本之间通过超球隔开.增量学习时"对新增样本以及旧样本集中的支持向量和超球附近的非支持向量进行训练,使得算法在很小的空间代价下实现兼类样本类增量学习.分类过程中,根据待分类样本到各超球球心的距离判定其所属类别.实验结果表明,该算法具有较快的训练,分类速度和较高的分类精度.

     

模糊线性支持向量回归机

该文研究了当训练点的输出为三角模糊数时,支持向量回归机的构建问题。首先将模糊回归问题转化为模糊分类问题,并将求模糊最优分类超平面问题转化为求解带有模糊决策的机会约束规划问题。利用基于模糊模拟的遗传算法求解带有模糊决策的机会约束规划,得到模糊最优分类超平面(模糊方程),解模糊方程得到模糊回归函数。在此基础上,得出模糊线性支持向量回归机(算法)。从而较好地解决了支持向量机中含有模糊信息的模糊回归问题。最后,给出显示模糊线性支持向量回归机特点的模糊支持向量集的定义。     

一种模糊加权的孪生支持向量机算法

虽然孪生支持向量机（Twin Support Vector Machine,TSVM）的处理速度优于传统的支持向量机,但其并没有考虑输入样本点对最优分类超平面所产生的不同影响。通过为每个训练样本赋予不同的样本重要性,以及减少样本点对非平行超平面的影响,提出了模糊加权孪生支持向量机（Fuzzy TSVM,FTSVM）。在UCI标准数据集上,对FTSVM进行了实验研究并与TSVM、FSVM和SVM方法进行了比较,实验结果表明FTSVM方法是有效的。     

基于模糊支持向量机与决策树的文本分类器

针对模糊支持向量机在文本分类应用中的隶属度函数确定问题,提出了一种基于模糊支持向量机与决策树的文本分类器的构建方法。该方法不仅考虑了样本与类中心之间的关系,还根据传统支持向量机中包含支持向量且平行于分类面的平面构建切球,来确定类中各个样本之间的关系,由样本点与球的位置关系计算其隶属度,可以合理地区分有效样本和噪音、孤立点样本。并与决策树方法相结合,实现多类分类。实验结果表明,该方法具有良好的分类效果。     

A Fuzzy Hierarchical Classification System for Olfactory Signals

A fuzzy logic-based system to classify olfactory signals is presented. The odour samples are obtained from an electronic nose that contains conducting polymer sensors with partially overlapping sensitivities to odours. The sensor responses are represented by means of the coefficients of their Fast Fourier Transform (FFT). A feature reduction method is applied to reduce the feature space dimension. Then, an Unsupervised Fuzzy Divisive Hierarchical Clustering (UFDHC) method is used to establish the optimal number of clusters in the data set, as well as the optimal cluster structure. The output of UFDHC is a binary hierarchy of fuzzy classes that are adopted to build a supervised fuzzy hierarchical classifier. At each level of the hierarchy a separating hyperplane of the two corresponding fuzzy classes is determined. The hyperplane identifies two crisp decision regions, which will be refined at the next level of the hierarchy. In this way, we obtain a hierarchy of regions, which defines a crisp decision tree. Each region is, therefore, related to a specific expected output of the system. Two small-scale applications demonstrate the effectiveness and the good recognition performance of the proposed method.     

软间隔模糊粗糙支持向量机

分析了硬间隔模糊粗糙支持向量机(FRSVMs)的优点与不足。FRSVMs通过修改硬间隔支持向量机(SVMs)的约束条件提高了泛化能力;FRSVMs虽然将训练样例的条件属性与决策属性之间的不一致性考虑在内,但是在寻找最优超平面时仍然要求将训练集完全正确地分开,因此对噪音具有敏感性。针对FRSVMs的这个缺点,提出了软间隔模糊粗糙支持向量机(C-FRSVMs)。它使用高斯核函数作为模糊相似关系,将数据集中样例的条件属性与决策标签之间的不一致程度考虑在内;在训练寻找最优超平面的过程中允许存在错分点,并对原始最优化问题中训练样例的错分程度进行惩罚;既考虑了间隔最大,又考虑了训练误差最小,从而降低了对噪音的敏感性。实验表明:针对一些数据集,无论其是否存在异常点,C-FRSVMs在测试精度上都可以同时优于硬间隔SVMs、软间隔支持向量机(C-SVMs)和FRSVMs,从而进一步提高了FRSVMs的泛化能力。     

Support vector machines with genetic fuzzy feature transformation for biomedical data classification

In this paper, we present a genetic fuzzy feature transformation method for support vector machines (SVMs) to do more accurate data classification. Given data are first transformed into a high feature space by a fuzzy system, and then SVMs are used to map data into a higher feature space and then construct the hyperplane to make a final decision. Genetic algorithms are used to optimize the fuzzy feature transformation so as to use the newly generated features to help SVMs do more accurate biomedical data classification under uncertainty. The experimental results show that the new genetic fuzzy SVMs have better generalization abilities than the traditional SVMs in terms of prediction accuracy.     

基于数据分布一致性最小最大概率机

针对既包含有标记样本又包含未标记样本的分类数据,提出数据分布一致性原理,并将其融入到最小最大概率机中。把有标记样本和无标记样本映射到决策超平面所在空间（简称超空间）,通过最小化有标记样本和无标记样本在超空间的概率分布差异,充分利用无标签样本来修正最小最大概率机的误差,使得修正后的决策超平面更接近于真正的分类超平面。实验证明,数据分布一致性最小最大概率机（DCMPM）比最小最大概率机（MPM）具有更好的分类性能。     

A method to make multiple hypotheses with high cumulative recognition rate using SVMs

This paper describes a method to make multiple hypotheses with high cumulative recognition rate using SVMs. To make just a single hypothesis by using SVMs, it has been shown that Directed Acyclic Graph Support Vector Machines (DAGSVM) is very good with respect to recognition rate, learning time and evaluation time. However, DAGSVM is not directly applicable to make multiple hypotheses. In this paper, we propose a hybrid method of DAGSVM and Max-Win algorithm. Based on the result of DAGSVM, a limited set of classes are extracted. Then, Max-Win algorithm is applied to the set. We also provide the experimental results to show that the cumulative recognition rate of our method is as good as the Max-Win algorithm, and that the execution time is almost as fast as DAGSVM.     

Multi-class fuzzy support matrix machine for classification in roller bearing fault diagnosis

As a new classification method with the matrix as the input, support matrix machine (SMM) makes full use of the structured information between rows and columns of the input matrix to establish an accurate prediction model, which has been widely used in the field of fault diagnosis. However, the principle of SMM is to construct two parallel hyperplanes to complete the segmentation between different types of samples. When there are noise and outliers in the sample data, it is difficult for SMM to construct an ideal parallel hyperplane. In view of this, this paper proposes a multi-class fuzzy support matrix machine (MFSMM) by establishing nonparallel hyperplane objective function and integrating fuzzy attributes. In MFSMM, MFSMM establishes two nonparallel fuzzy hyperplanes by objective function, which maximizes the interval between any two fuzzy hyperplanes while considering the sample structure information. Meanwhile, fuzzy plane assigns different membership degrees to different training samples, which greatly reduces the influence of noise on the construction of optimal classification hyperplane. By analyzing two kinds of roller bearing experimental data, the results show that MFSMM has higher classification accuracy and stronger fault tolerance for samples with uncertain information.     

Incorporating fuzzy membership functions into the perceptron algorithm

The perceptron algorithm, one of the class of gradient descent techniques, has been widely used in pattern recognition to determine linear decision boundaries. While this algorithm is guaranteed to converge to a separating hyperplane if the data are linearly separable, it exhibits erratic behavior if the data are not linearly separable. Fuzzy set theory is introduced into the perceptron algorithm to produce a ``fuzzy algorithm' which ameliorates the convergence problem in the nonseparable case. It is shown that the fuzzy perceptron, like its crisp counterpart, converges in the separable case. A method of generating membership functions is developed, and experimental results comparing the crisp to the fuzzy perceptron are presented.     

面向不均衡分类的隶属度加权模糊支持向量机

针对不均衡分类问题,提出了一种基于隶属度加权的模糊支持向量机模型。使用传统支持向量机对样本进行训练,并通过样本点与所得分类超平面之间的距离构造模糊隶属度,这不仅能够消除噪点和野值点的影响,而且可以在一定程度上约减样本;利用正负类的平均隶属度和样本数量求得平衡调节因子,消除数据不平衡时造成的分类超平面的偏移现象;通过实验结果验证了该算法的可行性和有效性。实验结果表明,该算法能有效提高分类精度,特别是对不平衡数据效果更加明显,在训练速度和分类性能上比传统支持向量机和模糊支持向量机有进一步的提升。