Multi-Class Support Vector Machine Classifier Based on Jeffries-Matusita Distance and Directed Acyclic Graph

Based on the framework of support vector machines( SVM) using one-against-one( OAO) strategy, a new multi-class kernel method based on directed acyclic graph( DAG) and probabilistic distance is proposed to raise the multi-class classification accuracies. The topology structure of DAG is constructed by rearranging the nodes' sequence in the graph. DAG is equivalent to guided operating SVM on a list,and the classification performance depends on the nodes' sequence in the graph. Jeffries-Matusita distance( JMD) is introduced to estimate the separability of each class,and the implementation list is initialized with all classes organized according to certain sequence in the list. To testify the effectiveness of the proposed method,numerical analysis is conducted on UCI data and hyperspectral data. Meanwhile,comparative studies using standard OAO and DAG classification methods are also conducted and the results illustrate better performance and higher accuracy of the proposed JMD-DAG method.

Multi-class classification method for strip steel surface defects based on support vector machine with adjustable hyper-sphere

Focusing on strip steel surface defects classification, a novel support vector machine with adjustable hyper-sphere （AHSVM） is formulated. Meanwhile, a new multi-class classification method is proposed. Originated from support vector data description, AHSVM adopts hyper-sphere to solve classification problem. AHSVM can obey two principles： the margin maximization and inner-class dispersion minimization. Moreover, the hyper-sphere of AHSVM is adjustable, which makes the final classification hyper-sphere optimal for training dataset. On the other hand, AHSVM is combined with binary tree to solve multi-class classification for steel surface defects. A scheme of samples pruning in mapped feature space is provided, which can reduce the number of training samples under the premise of classification accuracy, resulting in the improvements of classification speed. Finally, some testing experiments are done for eight types of strip steel surface defects. Experimental results show that multi-class AHSVM classifier exhibits satisfactory results in classification accuracy and efficiency.

Multi-class Classification Methods of Enhanced LS-TWSVM for Strip Steel Surface Defects

Considering strip steel surface defect samples, a multi-class classification method was proposed based on enhanced least squares twin support vector machines （ELS-TWSVMs） and binary tree. Firstly, pruning region samples center method with adjustable pruning scale was used to prune data samples. This method could reduce classifierr s training time and testing time. Secondly, ELS-TWSVM was proposed to classify the data samples. By introducing error variable contribution parameter and weight parameter, ELS-TWSVM could restrain the impact of noise sam- ples and have better classification accuracy. Finally, multi-class classification algorithms of ELS-TWSVM were pro- posed by combining ELS-TWSVM and complete binary tree. Some experiments were made on two-dimensional data- sets and strip steel surface defect datasets. The experiments showed that the multi-class classification methods of ELS-TWSVM had higher classification speed and accuracy for the datasets with large-scale, unbalanced and noise samples.

基于网格支持矢量机的涡轮泵多故障诊断

支持矢量机是一种基于结构风险最小化原则的机器学习方法,对小样本决策具有较好的学习推广性。由于常规支持矢量机算法是从二类分类问题推导得出的,在解决故障诊断这种典型的多类分类问题时存在困难,为此提出一种网络支持矢量机多类分类算法,用每个类别和其他两个至四个类别构造二类支持矢量机分类器。这些二类支持矢量机分类器组合而成的网格式结构多类分类器,具有容易扩展、重复训练样本少、速度快和识别正确率高的优点。将网格式结构多类分类器应用于涡轮泵试验台多故障诊断获得了令人满意的效果。

传感器网络定位中节点攻击类型的分布式识别算法

针对无线传感器网络在定位过程中的外部攻击节点的类型识别问题,提出了一种交替方向-Lp范数支持向量机(ADM-PSVM)分布式识别算法。该算法基于线性支持向量机分类模型,首先引入了Lp范数约束形式,通过选择不同的范数值p以增强分类算法对数据集的适应能力;继而根据交替方向乘子方法推导出了算法的分布式形式,实现了节点根据剩余能量将识别的计算任务分布于不同节点之间进行;最后将算法对各类型的恶意节点数据进行了训练及识别仿真,并讨论了范数约束值以及惩罚因子取值的不同对识别精确率的影响。仿真结果表明,该算法对于恶意外部攻击节点数据具有较好的识别精确度及更高的计算效率。

基于新型多分类支持向量算法的发动机故障诊断(英文)

Hierarchical Support Vector Machine （H-SVM） is faster in training and classification than other usual multi-class SVMs such as ＂1-V-R＂and ＂1-V-1＂. In this paper, a new multi-class fault diagnosis algorithm based on H-SVM is proposed and applied to aero-engine. Before SVM training, the training data are first clustered according to their class-center Euclid distances in some feature spaces. The samples which have close distances are divided into the same sub-classes for training, and this makes the H-SVM have reasonable hierarchical construction and good generalization performance. Instead of the common C-SVM, the v-SVM is selected as the binary classifier, in which the parameter v varies only from 0 to 1 and can be determined more easily. The simulation results show that the designed H-SVMs can fast diagnose the multi-class single faults and combination faults for the gas path components of an aero-engine. The fault classifiers have good diagnosis accuracy and can keep robust even when the measurement inputs are disturbed by noises.

A primal perspective for indefinite kernel SVM problem

Indefinite kernel support vector machine(IKSVM)has recently attracted increasing attentions in machine learning.Since IKSVM essentially is a non-convex problem,existing algorithms either change the spectrum of indefinite kernel directly but risking losing some valuable information or solve the dual form of IKSVM whereas suffering from a dual gap problem.In this paper,we propose a primal perspective for solving the problem.That is,we directly focus on the primal form of IKSVM and present a novel algorithm termed as IKSVM-DC for binary and multi-class classification.Concretely,according to the characteristics of the spectrum for the indefinite kernel matrix,IKSVM-DC decomposes the primal function into the subtraction of two convex functions as a difference of convex functions(DC)programming.To accelerate convergence rate,IKSVM-DC combines the classical DC algorithm with a line search step along the descent direction at each iteration.Furthermore,we construct a multi-class IKSVM model which can classify multiple classes in a unified form.A theoretical analysis is then presented to validate that IKSVM-DC can converge to a local minimum.Finally,we conduct experiments on both binary and multi-class datasets and the experimental results show that IKSVM-DC is superior to other state-of-the-art IKSVM algorithms.