线性可分问题的支撑向量稳健感知器及其几何训练算法

分类器的稳健性能是分类器的重要性质之一。支撑向量机SVM和稳健感知器得到的都是最优分类面，都具有很强的稳健性能。SVM构造的是到所有支撑向量(距分类面最近的样本)等距离的最优分类面，SVM算法需要求解一个二次型寻优问题；而稳健感知器构造的是到所有基(各模式类的边界样本)距离都较远的最优分类面，稳健感知器需要求解一系列的线性规划。文章在二者的基础上提出了适用于线性可分问题的支撑向量稳健感知器及其几何训练算法．它将问题转化成了一系列的线性方程组，它将比SVM的二次型寻优具有更快的速度。实验仿真表明了该算法的高效性。     

基于LPC倒谱参数和支持向量机技术的说话人识别系统

采用能够反映人对语音的感知特性的线性预测(LPC)倒谱参数为特征参数,同时针对支持向量机技术对模式识别中的非线性、高维数的样本问题有非常好的分类效果和学习推广能力,设计了一个支持向量机分类器来进行说话人识别。试验结果验证了该系统有很高的识别率和较强的鲁棒性。     

粗糙集和支持向量机在复杂电路系统诊断中的应用

为了解决复杂电路系统故障样本少、特征信息冗杂的问题,提出了一种基于粗糙集属性约简理论和支持向量机分类方法相结合的故障诊断方法.首先采用粗糙集约简故障模式库中的冗余特征属性和矛盾样本,然后提取最简故障特征模式作为支持向量机的学习样本,通过样本训练使构建的支持向量机多分类器能够快速实现故障诊断的目的.最后,通过仿真算例验证了该方法在小样本故障识别上的有效性和可行性.     

基于SOM神经网络的航舵故障分类方法

为解决航舵故障诊断的复杂非线性模式分类问题,提出一种基于自组织特征映射(SOM)神经网络的航舵故障诊断方法,构造一个2层SOM神经网络,训练后多个权值向量位于输入向量聚类中心,实现快速有效的自适应分类.仿真结果表明:SOM网络经过100次训练即可实现聚类,对有限故障测试样本分类准确率可达90％,对航舵故障诊断具有一定的参考价值.     

样本不平衡下的海杂波弱目标分类研究

现有的海面弱目标分类算法难以应对单域特征造成特征混叠问题,且存在海杂波和目标样本不平衡的问题。因此,本文研究了一种样本不平衡下的海杂波弱目标分类的方法。首先,从多域提取特征,其中包括从极化域提取球体、双平面和螺旋散射的相对功率特征,从时域提取相对平均幅度特征、和从频域提取非广延熵特征。然后对比分析了海杂波和目标的多域特征之间的区别。由于海杂波特征的样本数目远大于目标样本数目,且海杂波特征具有局部聚集性,为了解决这种样本不平衡以及特征混叠所导致的分类偏差问题,本文设计了一种K均值和支持向量机（SVM）结合的分类器。该分类器主要通过将海杂波样本进行K均值动态聚类,将原本属于一类的海杂波样本分成多类,缓解样本非平衡现象,然后再将多类海杂波样本与目标样本进行SVM分类。经过实测数据验证,该方法具有良好的分类性能。      

基于Matlab平台人脸识别仿真过程的探究

Matlab是一种科学与工程计算的高级语言,广泛地运用在包括信号与图像处理、控制系统设计等方面,我们使用Matlab作为平台,设计GUI,探究人脸识别的过程。在特征提取方面,运用主成分分析法(PCA)算法,对高维特征进行降维,保证了高位数据不失真,在分类器算法上采用支持向量机(SVM)和自适应提升(Adaboost)算法进行对比实验,SVM通过求解由全部训练样本对检测样本最佳线性表示的稀疏向量来进行分类,Adaboost算法针对不同的训练集训练同一个基本分类器(弱分类器)进行多次迭代,每次迭代增加错样本的权重,构成一个更强的最终的分类器(强分类器),实验结果表明,仿真能够达到较高的识别率和缩短识别的时间。     

基于向量机的体育运动视频自动分类方法设计

为有效增加分类的准确度及适用性,提出一种基于支持向量机的体育运动视频自动分类方法,能够实现样本复杂的海量体育视频的高效管理。首先构建基于视觉词袋模型的视频分类框架;然后采用类型关键帧建立对应的视频帧训练库;最后通过主成分分析对输入视频帧进行降维处理,以便快速得到输入视频帧的最佳支持向量机分类器参数,从而最终实现自动分类。利用多种类型混合的体育视频数据集进行分类实验。实验结果表明,提出的体育运动视频分类算法能够快速有效地实现分类,并获得较高的分类精度。     

基于随机子空间-正交局部保持投影的支持向量机

针对高维数、小样本数据分类问题,提出一种基于随机子空间-正交局部保持投影的支持向量机.利用随机子空间方法对原始高维样本的特征空间进行多次随机采样,生成多个具有不同特征子集的基支持向量机(SVM)分类器;利用正交局部保持投影对各基SVM分类器的样本进行特征提取,实现维数约简;然后,利用降维后的样本对各基SVM分类器进行训...     

一种基于支持向量机的雷达多目标分类方法

针对小样本条件下雷达目标分类精度低的问题,提出了一种基于支持向量机(Support Vector Machine,SVM)的雷达目标分类方法。通过雷达目标特征的提取、选择和分类器的设计,实现了目标的多分类,且提高了目标分类精度。实验结果表明,基于二维特征的分类器可实现多目标的高精度分类,且平均分类精度均优于85%。     

基于复合核支持向量回归机的多类分类算法

针对传统支持向量机(SVM)在解决多类分类问题时需要训练多个分类器、存在不可分区域等问题,研究了基于支持向量回归机的多类分类算法。利用回归思想求解多类分类问题,将分类样本作为回归输入,样本的类别标识作为回归输出,通过支持向量回归机训练拟合出各样本与其类别标识之间的函数关系。将待分类样本代入回归函数,对其输出取整后即可得到样本类别。该算法仅使用1个分类器,明显简化了分类过程。另外,引入复合核函数来提高支持向量回归机的性能。采用加州大学欧文分校(UCI)例题库中的多类分类问题进行仿真验证,并将改进算法与传统算法作对比,结果表明改进算法在分类速度和准确率上都有显著提高。     

基于自编码网络特征降维的轻量级入侵检测模型

基于支持向量机(SVM)的入侵检测方法受时间和空间复杂度约束,在高维特征空间计算时面临“维数灾害”的问题.为此,本文提出一种基于自编码网络的支持向量机入侵检测模型(AN-SVM).首先,该模型采用多层无监督的限制玻尔兹曼机(RBM)将高维、非线性的原始数据映射至低维空间,建立高维空间和低维空间的双向映射自编码网络结构,进而运用基于反向传播网络的自编码网络权值微调算法重构低维空间数据的最优高维表示,从而获得原始数据的相应最优低维表示;最后,采用SVM分类算法对所学习到的最优低维表示进行入侵识别.实验结果表明,AN-SVM模型降低了入侵检测模型中分类的训练时间和测试时间,并且分类效果优于传统算法,是一种可行且高效的轻量级入侵检测模型.     

Ideal observer approximation using Bayesian classification neural networks

It is well understood that the optimal classification decision variable is the likelihood ratio or any monotonic transformation of the likelihood ratio. An automated classifier which maps from an input space to one of the likelihood ratio family of decision variables is an optimal classifier or "ideal observer." Artificial neural networks (ANNs) are frequently used as classifiers for many problems. In the limit of large training sample sizes, an ANN approximates a mapping function which is a monotonic transformation of the likelihood ratio, i.e., it estimates an ideal observer decision variable. A principal disadvantage of conventional ANNs is the potential over-parameterization of the mapping function which results in a poor approximation of an optimal mapping function for smaller training samples. Recently, Bayesian methods have been applied to ANNs in order to regularize training to improve the robustness of the classifier. The goal of training a Bayesian ANN with finite sample sizes is, as with unlimited data, to approximate the ideal observer. We have evaluated the accuracy of Bayesian ANN models of ideal observer decision variables as a function of the number of hidden units used, the signal-to-noise ratio of the data and the number of features or dimensionality of the data. We show that when enough training data are present, excess hidden units do not substantially degrade the accuracy of Bayesian ANNs. However, the minimum number of hidden units required to best model the optimal mapping function varies with the complexity of the data.     

Diagnosing old MI by searching for a linear boundary in the space of principal components.

Body surface potential mapping (BSPM) is a technique employing multiple electrodes to capture, via noninvasive means, an indication of the heart's condition. An inherent problem with this technique is the resulting high-dimensional recordings and the subsequent problems for diagnostic classifiers. A data set, recorded from a 192-lead BSPM system, containing 74 records is investigated. QRS isointegral maps, offering a summary of the information obtained during ventricular depolarization, were derived from 30 old inferior myocardial infarction and 44 normal recordings. Principal component analysis was applied to reduce the dimensionality of the recordings and a linear classifier was employed for classification. This perceptron-based classifier has been adapted so that the final weight and bias values are estimated prior to the learning process. This estimation process, referred to as the linear hyperplane approach (LHA), derives the estimated weights from a bisector hyperplane, placed orthogonal to the means of two class distributions in an n-dimensional Euclidean space. Estimating weights encourages a network to exhibit better generalization ability. Utilizing a number of different principal components as input features, the LHA achieved an average sensitivity and specificity of 79.58% and 76.45%, respectively, across all experiments. The average accuracy of 76.73% achieved with this approach was significantly better than the other benchmark classifiers evaluated against it.     

基于中心矩特征的空间目标识别方法

目标的雷达散射截面（RCS）包含了丰富的目标类别信息，有效地利用目标RCS特征对空间目标的雷达识别具有重要的意义。该文利用空间目标回波的距离维信号来进行识别。中心矩特征具有平移不变性，是一种简单有效的波形特征提取算法。文中首先提取中心矩作为特征向量，再采用Fisher判据进一步进行特征压缩，最后利。用支撑矢量机（SVM）分类算法实现识别。基于实测数据的仿真实验结果表明，该方法具有较好的识别性能和推广能力。     

带拒识能力的双层支持向量模型分类器

本文构造了一种带拒识能力的双层支持向量模型分类器.在训练学习过程中,首先对各类样本特征空间求取最小的包含球形边界,得到各类样本的球形支持向量域表示.这样对于输入的非目标样本即可利用各类的支持向量域进行拒识或接受处理;然后针对接受的样本再利用基于超平面分割的SVM训练器进行分类判决.无论是在第一层求取边界的优化问题中,还是在第二层的分类超平面优化过程中,都采用相乘性更新迭代规则直接求解,优化速度与最小二乘支持向量机(LS-SVM)相当.仿真实验表明本文提出的通过引入拒绝层和判决层的新支持向量模型策略是合理可行的,在实际模式识别领域具有广阔的应用前景.     

Statistical Classification of Buried Unexploded Ordnance Using Nonparametric Prior Models

We used kernel density estimation (KDE) methods to build a priori probability density functions (pdfs) for the vector of features that are used to classify unexploded ordnance items given electromagnetic-induction sensor data. This a priori information is then used to develop a new suite of estimation and classification algorithms. As opposed to the commonly used maximum-likelihood parameter estimation methods, here we employ a maximum a posteriori (MAP) estimation algorithm that makes use of KDE-generated pdfs. Similarly, we use KDE priors to develop a suite of classification schemes operating in both "feature" space as well as ldquosignal/datardquo space. In terms of feature-based methods, we construct a support vector machine classifier and its extension to support M-ary classification. The KDE pdfs are also used to synthesize a MAP feature-based classifier. To address the numerical challenges associated with the optimal data-space Bayesian classifier, we have used several approximation techniques, including Laplacian approximation and generalized likelihood ratio tests employing the priors. Using both simulations and real field data, we observe a significant improvement in classification performance due to the use of the KDE-based prior models.     

基于粒子群优化的对抗样本生成算法

随着机器学习被广泛的应用,其安全脆弱性问题也突显出来。该文提出一种基于粒子群优化(PSO)的对抗样本生成算法,揭示支持向量机(SVM)可能存在的安全隐患。主要采用的攻击策略是篡改测试样本,生成对抗样本,达到欺骗SVM分类器,使其性能失效的目的。为此,结合SVM在高维特征空间的线性可分的特点,采用PSO方法寻找攻击显著性特征,再利用均分方法逆映射回原始输入空间,构建对抗样本。该方法充分利用了特征空间上线性模型上易寻优的特点,同时又利用了原始输入空间篡改数据的可解释性优点,使原本难解的优化问题得到实现。该文对2个公开数据集进行实验,实验结果表明,该方法通过不超过7%的小扰动量生成的对抗样本均能使SVM分类器失效,由此证明了SVM存在明显的安全脆弱性。     

A study on several machine-learning methods for classification of malignant and benign clustered microcalcifications

In this paper, we investigate several state-of-the-art machine-learning methods for automated classification of clustered microcalcifications (MCs). The classifier is part of a computer-aided diagnosis (CADx) scheme that is aimed to assisting radiologists in making more accurate diagnoses of breast cancer on mammograms. The methods we considered were: support vector machine (SVM), kernel Fisher discriminant (KFD), relevance vector machine (RVM), and committee machines (ensemble averaging and AdaBoost), of which most have been developed recently in statistical learning theory. We formulated differentiation of malignant from benign MCs as a supervised learning problem, and applied these learning methods to develop the classification algorithm. As input, these methods used image features automatically extracted from clustered MCs. We tested these methods using a database of 697 clinical mammograms from 386 cases, which included a wide spectrum of difficult-to-classify cases. We analyzed the distribution of the cases in this database using the multidimensional scaling technique, which reveals that in the feature space the malignant cases are not trivially separable from the benign ones. We used receiver operating characteristic (ROC) analysis to evaluate and to compare classification performance by the different methods. In addition, we also investigated how to combine information from multiple-view mammograms of the same case so that the best decision can be made by a classifier. In our experiments, the kernel-based methods (i.e., SVM, KFD, and RVM) yielded the best performance (Az = 0.85, SVM), significantly outperforming a well-established, clinically-proven CADx approach that is based on neural network (Az = 0.80).     

Scale space classification using area morphology

We explore the application of area morphology to image classification. From the input image, a scale space is created by successive application of an area morphology operator. The pixels within the scale space corresponding to the same image location form a scale space vector. A scale space vector therefore contains the intensity of a particular pixel for a given set of scales, determined in this approach by image granulometry. Using the standard k-means algorithm or the fuzzy c-means algorithm, the image pixels can be classified by clustering the associated scale space vectors. The scale space classifier presented here is rooted in the novel area open-close and area close-open scale spaces. Unlike other scale generating filters, the area operators affect the image by removing connected components within the image level sets that do not satisfy the minimum area criterion. To show that the area open-close and area close-open scale spaces provide an effective multiscale structure for image classification, we demonstrate the fidelity, causality, and edge localization properties for the scale spaces. The analysis also reveals that the area open-close and area close-open scale spaces improve classification by clustering members of similar objects more effectively than the fixed scale classifier. Experimental results are provided that demonstrate the reduction in intra-region classification error and in overall classification error given by the scale space classifier for classification applications where object scale is important. In both visual and objective comparisons, the scale space approach outperforms the traditional fixed scale clustering algorithms and the parametric Bayesian classifier for classification tasks that depend on object scale.