基于核Fisher判别分析的意识任务识别新方法

提出一种新的基于核Fisher判别分析的意识任务识别新方法。该方法首先通过核函数建立一个非线性映射,把原空间的样本点投影到一个高维特征空间,然后在特征空间应用线性Fisher判别。利用不同意识任务生成的脑电数据对KFDA和FDA进行比较,最后用线性支持向量机进行分类和识别,并与非线性支持向量机进行了比较,结果表明KFDA的识别率明显优于后二者。     

基于核Fisher判别分析的意识任务识别新方法

提出一种新的基于核Fisher判别分析的意识任务识别新方法。该方法首先通过核函数建立一个非线性映射，把原空间的样本点投影到一个高维特征空间，然后在特征空间应用线性Fisher判别。利用不同意识任务生成的脑电数据对KFDA和FDA进行比较，最后用线性支持向量机进行分类和识别，并与非线性支持向量机进行了比较，结果表明KFDA的识别率明显优于后二者。     

基于核Fisher判决分析的高性能多类分类算法

探讨了核Fisher判决分析算法(KernelFisherDiscriminantAnalysis,KFDA),并提出了一种基于KFDA的高性能多类分类算法。在进行多类分类时,首先通过一个非线性映射将训练样本映射到一个高维的核空间中,建立一个KFDA子空间,在该高维空间中,不同类别的样本之间的差异增大,同类样本聚集在一起,因此,在这个高维核空间中,就可以利用简单的最近邻法进行多类分类。实验结果表明,该算法在保证分类精度的条件下提高了分类器的训练和分类的速度。     

基于时点分割的核Fisher判别分析–顺序回归机多类分类建模方法

针对多维时间序列的多类分类问题,本文提出基于时点分割思想的核Fisher判别分析-顺序回归机(KFDA-ORM)多类分类建模方法.该方法利用核Fisher判别分析(KFDA)与顺序回归机(ORM)的互补性得到分类决策函数;对分类样本的多维时间序列进行时点分割处理,使用决策函数得到各时点的分类级别;通过指数平滑分析得到采样周期内样本的最终分类结果.通过实例验证,该方法对多维时间序列的分类具有较好效果,是一种有效的多类分类方法.     

基于低密度分割几何距离的半监督KFDA算法

提出了一种基于低密度分割几何距离的半监督KFDA（kernel Fisher discriminant analysis）算法（semisupervised KFDA based on low density separation geometry distance，简称SemiGKFDA）.该算法以低密度分割几何距离作为相似性度量，通过大量无标签样本，提高KFDA算法的泛化能力.首先，利用核函数将原始空间样本数据映射到高维特征空间中；然后，通过有标签样本和无标签样本构建低密度分割几何距离测度上的内蕴结构一致性假设，使其作为正则化项整合到费舍尔判别分析的目标函数中；最后，通过求解最小化目标函数获得最优投影矩阵.人工数据集和UCI数据集上的实验表明，该算法与KFDA及其改进算法相比，在分类性能上有显著提高.此外，将该算法与其他算法应用到人脸识别问题中进行对比，实验结果表明，该算法具有更高的识别精度.     

基于统计模式识别的岩石节理图像分割方法

岩石节理裂隙形状复杂,图像中含有很多噪声。而使用统计模式识别方法在分割图像时,可以首先使分类器学习图像中不同样本的特征,进而利用这些特征对图像中每个像素进行分类,实现分割。在设计统计模式识别的分类器时,我们提出使用基于核函数Fisher判别法构造分类器。使用该方法可以将图像高维的属性空间上的非线形判别转化为图像特征空间上的线形判别,而不需要知道从属性空间到特征空间的具体映射形式。通过对岩石节理裂隙图像分割实验表明,该方法能达到较其他方法更好的分割效果。     

基于核方法的雷达目标一维距离像识别

由于雷达目标及其所处环境的复杂性,导致不同目标之间的关系往往是非线性的.研究基于核的非线性方法,并将其应用于雷达目标一维距离像识别.核Fisher判别分析(KFDA)是一种抽取非线性特征的最有效方法之一,但它往往会面临小样本问题.针对此问题,给出一种null-KFDA方法,对距离像进行特征提取.然后,采用一种新的核非线性分类器——KNR(kernel-based nonlinear representor),对所提取的特征进行分类.对3种飞机的实测距离像进行实验,结果验证了null-KFDA的有效性.此外,与非线性支持向量机(SVM)和径向基函数神经网络(RBFNN)相比,KNR分类器具有更优的识别性能.     

李群核学习算法研究

分析了李群流形空间的几何结构、核函数和KFDA(kernel Fisher linear discriminant analysis)的原理,推导了矩阵李群内积空间的度量形式,进一步推导出5个李群核函数,并以此设计实现了KLieDA(kernel Lie group linear discriminant analysis)算法。李群核函数是适应性更广的核函数形式,由于欧氏空间的几何结构是李群的子集,李群函数不仅适用于矩阵李群的样本集,同时也适用于常规的向量形式的样本集。实验表明,基于李群函数和李群均值理论的KLieDA算法是一种快速高效的李群样本分类器。实验部分除了KLieDA的分类,还对基于李群核的SVM(support vector machine)算法进行手写体分类,结果表明,手写体图像的区域协方差李群特征具有较好的线性分布特性。     

一种核最大散度差判别分析人脸识别方法

提出一种有效的非线性子空间学习方法--核最大散度差判别分析(KMSD),并将其用于人脸识别.核最大散度差判别分析首先把输入空间的样本非线性映射到特征空间,然后通过核方法的技巧,采用最大散度差判别分析(MSD)方法在特征空间里求解.在Yale和ORL人脸数据库上的实验结果表明,提出的核最大散度差判别分析方法用于人脸识别具有较高的识别率.     

一种面向不平衡数据集的核Fisher线性判别分析方法

实际应用中,很多分类问题是面向不平衡数据的分类,而不平衡数据集会导致许多分类器的性能下降。文中介绍核Fisher线性判别分析的分类机制,分析不平衡数据导致核Fisher线性判别分析失效的原因,进而提出一种加权核Fisher线性判别分析方法。该方法通过调整两类样本的核协方差矩阵对核类内离散度矩阵的贡献, 可克服不平衡数据对分类性能的影响。为进一步测试该方法, 对UCI数据集进行实验测试,实验结果表明该方法可有效改进分类器的分类性能。     

一种用于人脸识别的非线性鉴别特征融合方法

最近，在人脸等图像识别领域，用于抽取非线性特征的核方法如核Fisher鉴别分析(KFDA)已经取得成功并得到了广泛应用，但现有的核方法都存在这样的问题，即构造特征空间中的核矩阵所耗费的计算量非常大．而且，抽取得到的单类特征往往不能获得到令人满意的识别结果．提出了一种用于人脸识别的非线性鉴别特征融合方法，即首先利用小波变换和奇异值分解对原始输入样本进行降雏变换，抽取同一样本空间的两类特征，然后利用复向量将这两类特征组合在一起，构成一复特征向量空间，最后在该空间中进行最优鉴别特征抽取．在ORL标准人脸库上的试验结果表明所提方法不仅在识别性能上优于现有的核Fisher鉴别分析方法，而且，在ORL人脸库上的特征抽取速度提高了近8倍．     

Fault diagnosis of nonlinear and large-scale processes using novel modified kernel Fisher discriminant analysis approach

It is pretty significant for fault diagnosis timely and accurately to improve the dependability of industrial processes. In this study, fault diagnosis of nonlinear and large-scale processes by variable-weighted kernel Fisher discriminant analysis (KFDA) based on improved biogeography-based optimisation (IBBO) is proposed, referred to as IBBO-KFDA, where IBBO is used to determine the parameters of variable-weighted KFDA, and variable-weighted KFDA is used to solve the multi-classification overlapping problem. The main contributions of this work are four-fold to further improve the performance of KFDA for fault diagnosis. First, a nonlinear fault diagnosis approach with variable-weighted KFDA is developed for maximising separation between the overlapping fault samples. Second, kernel parameters and features selection of variable-weighted KFDA are simultaneously optimised using IBBO. Finally, a single fitness function that combines erroneous diagnosis rate with feature cost is created, a novel mixed kernel function is introduced to improve the classification capability in the feature space and diagnosis accuracy of the IBBO-KFDA, and serves as the target function in the optimisation problem. Moreover, an IBBO approach is developed to obtain the better quality of solution and faster convergence speed. On the one hand, the proposed IBBO-KFDA method is first used on Tennessee Eastman process benchmark data sets to validate the feasibility and efficiency. On the other hand, IBBO-KFDA is applied to diagnose faults of automation gauge control system. Simulation results demonstrate that IBBO-KFDA can obtain better kernel parameters and feature vectors with a lower computing cost, higher diagnosis accuracy and a better real-time capacity.     

Fast kernel Fisher discriminant analysis via approximating the kernel principal component analysis

Kernel Fisher discriminant analysis (KFDA) extracts a nonlinear feature from a sample by calculating as many kernel functions as the training samples. Thus, its computational efficiency is inversely proportional to the size of the training sample set. In this paper we propose a more approach to efficient nonlinear feature extraction, FKFDA (fast KFDA). This FKFDA consists of two parts. First, we select a portion of training samples based on two criteria produced by approximating the kernel principal component analysis (AKPCA) in the kernel feature space. Then, referring to the selected training samples as nodes, we formulate FKFDA to improve the efficiency of nonlinear feature extraction. In FKFDA, the discriminant vectors are expressed as linear combinations of nodes in the kernel feature space, and the extraction of a feature from a sample only requires calculating as many kernel functions as the nodes. Therefore, the proposed FKFDA has a much faster feature extraction procedure compared with the naive kernel-based methods. Experimental results on face recognition and benchmark datasets classification suggest that the proposed FKFDA can generate well classified features.     

Nonlinear feature extraction and classification of multivariate data in kernel feature space

Batch processes have played an essential role in the production of high value-added product of chemical, pharmaceutical, food, bio-chemical, and semi-conductor industries. For productivity and quality improvement, several multivariate statistical techniques such as principal component analysis (PCA) and Fisher discriminant analysis (FDA) have been developed to solve a fault diagnosis problem of batch processes. Fisher discriminant analysis, as a traditional statistical technique for feature extraction and classification, has been shown to be a good linear technique for fault diagnosis and outperform PCA based diagnosis methods. This paper proposes a more efficient nonlinear diagnosis method for batch processes using a kernel version of Fisher discriminant analysis (KFDA). A case study on two batch processes has been conducted. In addition, the diagnosis performance of the proposed method was compared with that of an existing diagnosis method based on linear FDA. The diagnosis results showed that the proposed KFDA based diagnosis method outperforms the linear FDA based method.     

改进的核费舍判别分析法应用于故障诊断

化工过程采样数据具有强非线性和噪声,针对化工过程状态监控的问题,提出一种改进的核费舍判别分析法（KFDA）的故障诊断算法。首先采样数据经过小波变换方法去除噪声,去除噪声后的数据进行KFDA建模,然后在建模同时采用特征向量选择（FVS）算法降低复杂性。Tennessee Eastman process实验结果表明了该算法的有效性,同时该算法加强了KFDA故障诊断的准确性,并明显地减少了存储空间和运算时间。     

Fuzzy discriminant analysis with kernel methods

A novel fuzzy nonlinear classifier, called kernel fuzzy discriminant analysis (KFDA), is proposed to deal with linear non-separable problem. With kernel methods KFDA can perform efficient classification in kernel feature space. Through some nonlinear mapping the input data can be mapped implicitly into a high-dimensional kernel feature space where nonlinear pattern now appears linear. Different from fuzzy discriminant analysis (FDA) which is based on Euclidean distance, KFDA uses kernel-induced distance. Theoretical analysis and experimental results show that the proposed classifier compares favorably with FDA.     

On using prototype reduction schemes to optimize kernel-based fisher discriminant analysis.

Fisher's linear discriminant analysis (LDA) is a traditional dimensionality reduction method that has been proven to be successful for decades. Numerous variants, such as the kernel-based Fisher discriminant analysis (KFDA), have been proposed to enhance the LDA's power for nonlinear discriminants. Although effective, the KFDA is computationally expensive, since the complexity increases with the size of the data set. In this correspondence, we suggest a novel strategy to enhance the computation for an entire family of the KFDAs. Rather than invoke the KFDA for the entire data set, we advocate that the data be first reduced into a smaller representative subset using a prototype reduction scheme and that the dimensionality reduction be achieved by invoking a KFDA on this reduced data set. In this way, data points that are ineffective in the dimension reduction and classification can be eliminated to obtain a significantly reduced kernel matrix K without degrading the performance. Our experimental results demonstrate that the proposed mechanism dramatically reduces the computation time without sacrificing the classification accuracy for artificial and real-life data sets.     

一种基于空间变换的核Fisher鉴别分析

引入空间变换的思相想，提出了一种基于空间变换的核Fisher鉴别分析，与KFDA不同的是，该方法只需在一个较低维的空间内执行，从而较大幅度地降低了求解最优鉴别矢量集的计算量，提高了计算速度，在ORL标准人脸库上的试验结果验证了所提方法的有效性。