一种快速支持向量机分类算法的研究

提出一种快速的支持向量机分类算法——FCSVM,对支持向量集采用变换的方式,用少量的支持向量代替全部支持向量进行分类计算,在保证不损失分类精度的前提下使得分类速度有较大提高．在UCI标准数据集上进行的分类实验以及在FERET标准人脸库上进行的人脸识别实验都表明该算法具有较好的性能,在一定程度上克服了传统的支持向量机分类速度较慢的缺点、尤其在训练集规模庞大、支持向量数量较多的情况下,采用该算法能够较大幅度地减小计算复杂度,提高分类速度．     

一种支持向量机的快速分类算法

鉴于传统支持向量机分类过程的计算量和支持向量的个数成正比,为了提高分类决策的速度,提出一种约简支持向量的快速分类算法,该算法对原始的支持向量进行特定比例的模糊均值聚类操作,按照分类误差最小的原则构建最小线性二乘回归模型,求解新的支持向量系数和决策函数的偏置.人造数据集和标准数据集上的实验表明,约简50%支持向量后,可以在保持分类精度在无统计意义的明显损失的前提下,使得分类速度提高50%.     

一种变形Fisher判别准则函数及最优判别向量集

基于Fisher判别准则函数式,提出了一种无约束的最优判别矢量集,并给出了求解算法,另外,当训练样本矢量数小于样本矢量维数（即小样本问题）,类内散布矩阵奇异,此时求F-S最优判别向量集及文中提出的无约束的最优判别矢量集都已不可行,对此提出了一种变形的Fisher判别准则函数,并给出了求解最优判别向量集算法。用ORL标准人脸库进行实验,实验结果表明,提出的两种最优判别向量集都有良好的分类能力。     

一种具有统计不相关性的广义最优判别向量集

提出了一种新的最优判别向量集即统计不相关广义最优判别向量集 ,并给出了计算公式。用ORL人脸数据库进行人脸识别实验 ,结果表明该方法有较强的特征提取能力。     

一种新的支持向量机多类分类方法

分析了目前的支持向量机多类分类方法存在的问题以及缺点．针对以上问题及缺点，提出了基于二叉树的支持向量机的多类分类方法，并在UCI数据库上进行了验证，取得了良好效果．     

基于最佳鉴别向量集的多级分类方法

根据人的识别经验，采用多级分类方法；改进了最佳鉴别变换在模式类别数较多时的识别效果。首先从熵的大小和最佳鉴别向量集的分离能力两个角度来分析，当进行多级分类后，前者减小，即分类结果的可分性增加，后者得到增强。然后对人脸图像做奇异值分解和离散傅立叶变换，并分别提取最佳鉴别变换特征，用最近邻方法进行分类。在实验中，采用两级分类方法，因此计算量增加不大。     

一种加权支持向量机分类算法

提出了一种加权C—SVM分类算法,并从理论上分析了算法的性能。该算法通过引入类权重因子和样本权重因子实现了类加权和样本加权两种功能。实验结果表明,该算法可以有效地解决由类大小不均衡引发的分类错误问题以及重要样本的错分问题。     

基于支持向量机眼动模型的活性判别算法

提出一种基于支持向量机眼动模型的活性判别算法．该算法通过大量的人眼的样本来训练基于支持向量机的眼动模型，然后在活性判别过程中，通过被识别人进行眨眼的配合动作来完成活性判别的过程．由于人脸照片不可能做出眨眼的配合动作，因此照片就被成功地排除在了人脸识别系统的外面，从而提高了人脸自动识别系统的安全性．     

一种改进的支持向量机的文本分类算法

在文本分类中,应用支持向量机(SVM)算法能使分类在小样本的条件下具有良好的泛化能力.但支持向量机的参数取值决定了其学习性能和泛化能力.为提高支持向量机算法的性能,提出了一种采用免疫算法对支持向量机参数进行优化的文本分类算法(IA-SVM).算法减少了对支持向量机参数选择的盲目性,提高了SVM的预测精度.实验表明,IA-SVM算法在文本分类问题上明显提高了分类正确牢,学习速度也有提高.     

一种快速多分类支持向量机实现策略

基于二进制编码技术,提出一种快速多分类支持向量机实现策略.首先描述编码技术的实现思想,进一步给出避免多分类器中各个支持向量机的正负类样本数目不均衡的方法.并提出寻找多类别之间的最佳划分的策略,使该分类器在牺牲较小精度的情况下,具有较快的分类速度,适合应用于实时或在线分类系统中.最后根据实验结果对这种多分类器系统的性能进行评述.     

An improved discriminative common vectors and support vector machine based face recognition approach

An improved discriminative common vectors and support vector machine based face recognition approach is proposed in this paper. The discriminative common vectors (DCV) algorithm is a recently addressed discriminant method, which shows better face recognition effects than some commonly used linear discriminant algorithms. The DCV is based on a variation of Fisher’s Linear Discriminant Analysis for the small sample size case. However, for multiclass problem, the Fisher criterion is clearly suboptimal. We design an improved discriminative common vector by adjustment for the Fisher criterion that can estimate the within-class and between-class scatter matrices more accurately for classification purposes. Then we employ support vector machine as the classifier due to its higher classification and higher generalization. Testing on two public large face database: ORL and AR database, the experimental results demonstrate that the proposed method is an effective face recognition approach, which outperforms several representative recognition methods.     

一种新颖的核鉴别通用矢量集算法

为了进一步增强鉴别通用矢量集算法的性能,提出一种核鉴别通用矢量集算法.首先利用核函数将原始样本隐式地映射到高维特征空间;然后在高维特征空间里利用再生核理论建立鉴别通用矢量集算法的等价求解模型;最后根据新的求解模型,应用二次Gram-Schmidt正交化方法求出核类内零空间中的鉴别矢量集.在人脸库上的实验结果验证了文中算法的有效性.     

一种基于直推判别字典学习的零样本分类方法

零样本分类的目标是对训练阶段未出现过的类别的样本进行识别和分类,其主要思路是,借助类别语义信息,将可见类别的知识转移到未见类别中.提出了一种直推式的字典学习方法,包含以下两个步骤：首先,提出一个判别字典学习模型,对带标签的可见类别样本的视觉特征和类别语义特征建立映射关系模型;然后,针对可见类别和未见类别不同引起的域偏移问题,提出了一个基于直推学习的修正模型.通过在3个基准数据集（AwA,CUB和SUN）上的实验结果,证明了该方法的有效性和先进性.     

Discriminative tensor decomposition with large margin

Tensor decompositions have many application areas in several domains where one key application is revealing relational structure between multiple dimensions simultaneously and thus enabling the compression of relational data. In this paper, we propose the Discriminative Tensor Decomposition with Large Margin (shortly, Large Margin Tensor Decomposition, LMTD), which can be viewed as a tensor-to-tensor projection operation. It is a novel method for calculating the mutual projection matrices that map the tensors into a lower dimensional space such that the nearest neighbor classification accuracy is improved. The LMTD aims finding the mutual discriminative projection matrices which minimize the misclassification rate by minimizing the Frobenius distance between the same class instances (in-class neighbors) and maximizing the distance between different class instances (impostor neighbors). Two versions of LMTD are proposed, where the nearest neighbor classification error is computed in the feature (latent) or input (observations) space. We evaluate the proposed models on real data sets and provide a comparison study with alternative decomposition methods in the literature in terms of their classification accuracy and mean average precision.     

基于小波分解和鉴别共同矢量的人耳识别

针对高维、小样本的情况下使用Fisher线形鉴别分析进行特征提取存在的病态奇异问题,提出一种新的特征提取方法,即先对人耳样本图像进行二维离散小波分解,再利用DCV算法对小波分解后的低频信息分量作进一步的降维处理。不仅克服了小样本问题,也解决了直接使用DCV算法对人耳图像降维所引起的计算量大和计算速度过慢的问题。实验证明,该方法具有较好的识别率,是一种有效的特征提取算法。     

一种基于共同向量结合2DPCA的人脸识别方法

提出了一种基于共同向量结合2维主成分分析(2-dimen-sional principal component analysis, 2DPCA)的人脸识别方法. 共同向量由图像通过Gram-Schmidt正交变换而求得, 具有该类图像共同不变的性质. 原始图像与该类共同向量之间的差分向量通过2DPCA处理, 依据最小距离测试得到识别结果. 实验在ORL和Yale人脸数据库进行测试, 结果表明本文提出的方法有较好的识别性能.     

A fast method for the implementation of common vector approach

In this paper a novel computation method is proposed to perform the common vector approach (CVA) faster than its conventional implementation in pattern recognition. While conventional CVA calculations perform the classification with respect to the distance between vectors, the new method performs the classification using scalars. A theoretical proof of the equivalence of the proposed method is provided. Next, in order to verify the numerical equivalence of the proposed computation method to the conventional (vector-based) method, numerical experiments are conducted over three different face databases, namely the AR Database, extended Yale Face Database B, and FERET Database. Since the computational gain may depend on (i) the dimension of the feature vectors, (ii) the number of feature vectors used in training, and (iii) the number of classes, the effects of these items are clearly verified via these databases. Our theoretically equivalent (but faster) method provided no difference in the classification rates despite its improved classification speed as compared to the classical implementation of CVA. The new method is found to be about 2.1-3.0 times faster than the conventional CVA implementation for the AR face database, 1.9-3.3 times faster for the extended Yale Face Database B, and 1.9-3.1 times faster for the FERET Database.     

CFV-NB：基于概念特征向量的NB文档分类模型 

提出了一种基于概念特征向量的NB文档分类方法。该方法在未标注文档集上通过SOM（Self-Organizing Maps）聚类产生若干初始文档类，并为每个文档类分配一个类标签，使用最大信息熵的方法建立每个文档类的概念特征向量。在概念特征向量空间上建立最终的文档分类器：CFB-NB。     

Discriminative training via minimization of risk estimates based on Parzen smoothing

We describe a new approach to estimating classification risk in the domain of a suitably defined transformation that can be used as the basis for optimization of generic pattern recognition systems, including hidden Markov models and Multi-Layer Perceptrons. The two formulations of risk estimate described here are closely tied to the Minimum Classification Error/Generalized Probabilistic Descent (MCE/GPD) framework for discriminative training that is well-known to the speech recognition community. In the new approach, high-dimensional and possibly variable-length training tokens are mapped to the centers of Parzen kernels which are then easily integrated to find the risk estimate. The utility of such risk estimates lies in the fact that they are explicit functions of the system parameters and hence suitable for use in practical optimization methods. The use of Parzen estimation makes it possible to establish convergence of the risk estimate to the true theoretical classification risk, a result that formally expresses the benefit of linking the degree of smoothing to the training set size. Convergence of the minimized risk estimate is also analyzed. The new approach establishes a more general theoretical foundation for discriminative training than existed before, supporting previous work and suggesting new variations for future work.     

基于判别性子图重构的轻微肝性脑病分类*

大量研究表明轻微肝性脑病(MHE)与脑功能网络的异常相关,但难于寻找与MHE相关的异常子网络。为了解决这个问题,文中提出判别性子图重构的方法用于寻找与MHE相关的子网络,并将子网络用于MHE的分类。首先分别从MHE病人和非MHE(NMHE)病人的功能网络中挖掘一组频繁子图。然后,从频繁子图中挑选判别性子图用于重构原网络,并将判别性子图合并用于重构原网络。最后,使用图核计算重构网络之间的相似性,并使用核SVM分类。在包括77位肝硬化病人的数据集上的实验获得较高的分类精度,从而验证方法的有效性。