子空间半监督Fisher判别分析

Fisher判别分析寻找一个使样本数据类间散度与样本数据类内散度比值最大的子空间, 是一种很流行的监督式特征降维方法. 标注样本数据所属的类别通常需要大量的人工, 消耗大量的时间, 付出昂贵的成本. 为了解决同时利用有类别信息的样本数据和没有类别信息的样本数据用于寻找降维子空间的问题, 我们提出了一种子空间半监督Fisher判别分析方法. 子空间半监督Fisher判别分析寻找这样一个子空间, 这个子空间即保留了从有类别信息的样本数据中学习的类别判别结构, 也保留了从有类别信息的样本数据和没有类别信息的样本数据中学习的样本结构信息. 我们还推导了基于核的子空间半监督Fisher判别分析方法. 通过人脸识别实验验证了本文算法的有效性.     

Median MSD-based method for face recognition

An improved maximum scatter difference (MSD) criterion is proposed in this paper. A weakness of existing MSD model is that the class mean vector in the expressions of within-class scatter matrix and between-class scatter matrix is estimated by class sample average. Under the non-ideal conditions such as variations of expression, illumination, pose, and so on, there will be some outliers in the sample set, so the class sample average is not sufficient to provide an accurate estimate of the class mean using a few of given samples. As a result, the recognition performance of traditional MSD model will decrease. To address this problem, also to render MSD model rather robust, within-class median vector rather than within-class mean vector is used in the original MSD method. The results of experiments conducted on CAS-PEAL and FERET face database indicate the effectiveness of the proposed approach.     

L1范局部线性嵌入

数据降维问题存在于包括机器学习、模式识别、数据挖掘等多个信息处理领域。局部线性嵌入（LLE）是一种用于数据降维的无监督非线性流行学习算法,因其优良的性能,LLE得以广泛应用。针对传统的LLE对离群（或噪声）敏感的问题,提出一种鲁棒的基于L1范数最小化的LLE算法（L1-LLE）。通过L1范数最小化来求取局部重构矩阵,减小了重构矩阵能量,能有效克服离群（或噪声）干扰。利用现有优化技术,L1-LLE算法简单且易实现。证明了L1-LLE算法的收敛性。分别对人造和实际数据集进行应用测试,通过与传统LLE方法进行性能比较,结果显示L1-LLE方法是稳定、有效的。     

基于鲁棒主成分分析的智能电网虚假数据注入攻击

基于主成分分析（PCA）的盲攻击策略仅对具有高斯噪声的测量数据有效,在存在异常值的情况下,上述攻击策略将被传统的坏数据检测模块检测。针对异常值存在的问题,提出一种基于鲁棒主成分分析（RPCA）的盲攻击策略。首先,攻击者收集含有异常值的测量数据;然后,通过基于交替方向法（ADM）的稀疏优化技术从含有异常值的测量数据中分离出异常值和真实的测量数据;其次,对真实测量数据进行PCA,得到系统的相关信息;最后,利用获得的系统信息构造攻击向量,并根据得到的攻击向量注入虚假数据。该攻击策略在IEEE 14-bus系统上进行了测试,实验结果表明,在异常值存在的情况下,传统的基于PCA的攻击方法将被坏数据检测模块检测,而所提方法基于鲁棒PCA的攻击策略能够躲避坏数据检测模块的检测。该策略使得在异常值存在的情况下虚假数据注入攻击（FDIA）仍然能够成功实施。     

Enhanced locality preserving projections using robust path based similarity

Curse of dimensionality is a bothering problem in high dimensional data analysis. To enhance the performances of classification or clustering on these data, their dimensionalities should be reduced beforehand. Locality Preserving Projections (LPP) is a widely used linear dimensionality reduction method. It seeks a subspace in which the neighborhood graph structure of samples is preserved. However, like most dimensionality reduction methods based on graph embedding, LPP is sensitive to noise and outliers, and its effectiveness depends on choosing suitable parameters for constructing the neighborhood graph. Unfortunately, it is difficult to choose effective parameters for LPP. To address these problems, we propose an Enhanced LPP (ELPP) using a similarity metric based on robust path and a Semi-supervised ELPP (SELPP) with pairwise constraints. In comparison with original LPP, our methods are not only robust to noise and outliers, but also less sensitive to parameters selection. Besides, SELPP makes use of pairwise constraints more efficiently than other comparing methods. Experimental results on real world face databases confirm their effectiveness.     

Linear discriminant analysis with spectral regularization

Linear discriminant analysis (LDA) is a popular technique that works for both dimensionality reduction and classification. However, LDA faces the problem of small sample size in dealing with high dimensional data. Several approaches have been proposed to overcome this issue, but the resulting transformation matrix fails to extract shared structures among data samples. In this paper, we propose trace norm regularized LDA that not only tackles the problem of small sample size but also uncover the underlying structures between target classes. Specifically, our formulation characterizes the intrinsic dimensionality of a transformation matrix owing to the appealing property of trace norm. Evaluations over nine real data sets deliver the effectiveness of our algorithm.     

基于鲁棒的全局流形学习方法

非线性降维在数据挖掘、机器学习、图像分析和计算机视觉等领域应用广泛。等距映射算法(Isomap)是一种全局流形学习方法,能有效地学习等距流形的“低维嵌入”,但它对数据中的离群样本点缺乏鲁棒性。针对这种情况,该文提出一种离群点检测方法,基于Isomap的基本思想,给出一种鲁棒的全局流形学习方法,提高Isomap处理离群样本点的能力。数值实验表明了该方法的有效性。     

鲁棒的稀疏Lp-模主成分分析

主成分分析（Principle component analysis,PCA）是一种被广泛应用的降维方法.然而经典PCA的构造基于L₂-模导致了其对离群点和噪声点敏感,同时经典PCA也不具备稀疏性的特点.针对此问题,本文提出基于Lp-模的稀疏主成分分析降维方法（LpSPCA）.LpSPCA通过极大化带有稀疏正则项的Lp-模样本方差,使得其在降维的同时保证了稀疏性和鲁棒性.LpSPCA可用简单的迭代算法求解,并且当p≥1时该算法的收敛性可在理论上保证.此外通过选择不同的p值,LpSPCA可应用于更广泛的数据类型.人工数据及人脸数据上的实验结果表明,本文所提出的LpSPCA不仅具有较好的降维效果,并且具有较强的抗噪能力.     

Nonlinear discriminant clustering based on spectral regularization

Owing to sparseness, directly clustering high-dimensional data is still a challenge problem. Therefore, obtaining their low-dimensional compact representation by dimensional reduction is an effective method for clustering high-dimensional data. Most of existing dimensionality reduction methods, however, are developed originally for classification (such as Linear Discriminant Analysis) or recovering the geometric structure (known as manifold) of high-dimensional data (such as Locally Linear Embedding) rather than clustering purpose. Hence, a novel nonlinear discriminant clustering by dimensional reduction based on spectral regularization is proposed. The contributions of the proposed method are two folds: (1) it can obtain nonlinear low-dimensional representation that can recover the intrinsic manifold structure as well as enhance the cluster structure of the original high-dimensional data; (2) the clustering results can also be obtained in the dimensionality reduction procedure. Firstly, the desired low-dimensional coordinates are represented as linear combinations of predefined smooth vectors with respect to the data manifold, which are characterized by a weighted graph. Then, the optimal combination coefficients and the optimal cluster assignment matrix are computed by maximizing the ratio between the between-cluster scatter and the total scatter simultaneously as well as preserving the smoothness of the cluster assignment matrix with respect to the data manifold. Finally, the optimization problem is solved in an iterative procedure, which is proved to be convergent. Experiments on UCI data sets and real world data sets demonstrated the effectiveness of the proposed method for both clustering and visualization high-dimensional data set.     

基于鲁棒尺度的统计建模数据中异常点去除算法的研究及应用

针对基于主元分析 (PCA)的统计监控模型受到历史数据中异常点强烈影响的不足,鉴于建模历史数据中存在的异常点会影响过程监控效果,分析目前常用的鲁棒异常值检测算法原理及其缺陷,提出将中心最短距离(CDC)法与椭球多变量整理(MVT)法相结合,构成一种基于鲁棒尺度的CDC-MVT异常值综合检测算法,更加准确地检测异常点。将该算法应用于工业发酵过程,与CDC法和MVT法相比较,该算法能够有效去除建模数据中的异常点。     

基于鲁棒的余弦欧氏距离度量降维的图像检索方法

为解决主成分分析（PCA）无法处理非线性数据集以及鲁棒性差的问题,提出一种鲁棒的余弦-欧氏距离度量的降维方法（RCEM）。该方法利用余弦度量（CM）能够处理离群点的特点来提取数据的局部几何特征,并利用欧氏距离能够很好地保持样本的方差信息的特点来刻画数据集的全局分布,在保留数据局部信息的同时实现了局部和全局的统一,提高了局部降维算法的鲁棒性,同时避免了局部小样本问题。实验结果显示,与角度优化全局嵌入（AOGE）方法相比,在Corel-1000数据集下检索查准率提高了5.61%,相比不降维时检索时间减少了42%。结果表明,RCEM算法能在不降低图像检索精度的同时提高图像检索的效率,可以有效应用于基于内容的图像检索（CBIR）。     

最大散度差无监督鉴别特征抽取与人脸识别

最大散度差准则是对Fisher准则的改进,消除了小样本问题,但是该方法是基于整体特征的人脸识另q方?法,没有考虑到样本的局部特性.无监督的鉴别投影(UDP)技术,用于对高维数据进行维数缩减,它同时考虑到样本的局部特征和非局部特征,但是在人脸等高维图像识别的应用中,不可避免地会出现小样本问题.提出一种基于散度差的无监督鉴别特征抽取,避免了局部协方差奇异所产生的问题.在ORL人脸库和AR人脸库上的实验结果验证了该算法的有效性.     

具有时变采样周期的网络化控制系统故障检测

针对具有时变采样周期和时延的网络化控制系统(NCS)故障检测问题,通过矩阵 Jordan 变换,将时变采样周期与时延的不确定霆转化为NCS系统结构参数的不确定霆,建立离散时间凸多面体不确定系统模雿。设计鲁棒故障检测滤波器(RFDF)作为残差发生器,将故障检测问题转化为RFDF的设计问题,通过陑霆矩阵不等式给出滤波器存在的充分条件。数值仿真结果表明,所设计的RFDF滤波器能较快复现故障雷号,对外部干扰和不确定的采样周期及时延具有鲁棒霆。     

基于Delaunay三角网的空间离群挖掘

空间离群是指非空间属性与其空间邻居显著不同的空间对象。空间数据的特殊性决定了空间离群挖掘需要充分考虑空间数据的特点,才能挖掘出有现实意义的离群。本文对现有主要的空间数据离群挖掘算法进行了研究分析,针对k-邻域法确定空间邻域的缺点,基于Delaunay三角网在表达空间邻近关系的有效性,通过构建Delaunay三角网确定空间邻域并生成空间权重矩阵,据此提出了基于Delaunay三角网的空间离群挖掘算法DT_SOF,并以实际生态地球化学数据进行实验检验。结果表明,算法具有较低的用户依赖性,能准确挖掘空间离群。     

基于自联想核回归的带离群值化工过程故障检测EI北大核心CSCD

基于数据驱动的故障检测模型通常要求训练数据必须是正常操作条件下的测量值.然而在实际工业生产过程中,即使在正常工况下,数据集中也难以避免存在离群值.此时若仍采用传统的基于多元统计分析的方法,其监测模型的控制限会受到严重影响,造成故障漏报.因此,为了确保当训练数据包含离群值时,监测模型仍然呈现较好的故障检测效果,本文提出了一种基于自联想核回归的故障检测方法.首先基于最小化β散度的鲁棒预白化算法对训练集进行白化计算,消除变量之间相关性对样本相似度度量的影响.然后通过自联想核回归算法重构正常工况下的验证数据,根据重构误差建立模型监测指标.为了消除离群值对故障样本重构的影响,构造截断函数来避免离群样本参与相似故障数据的重构,并对所有参与构建Q统计量的残差变量基于指数加权滑动平均方法自适应加权,得到新的监测统计量.将该方法运用于田纳西–伊斯曼过程并与其他方法进行比较,验证了本文所提故障检测算法的有效性.     

Exact Low-Rank Matrix Completion from Sparsely Corrupted Entries Via Adaptive Outlier Pursuit

Recovering a low-rank matrix from some of its linear measurements is a popular problem in many areas of science and engineering. One special case of it is the matrix completion problem, where we need to reconstruct a low-rank matrix from incomplete samples of its entries. A lot of efficient algorithms have been proposed to solve this problem and they perform well when Gaussian noise with a small variance is added to the given data. But they can not deal with the sparse random-valued noise in the measurements. In this paper, we propose a robust method for recovering the low-rank matrix with adaptive outlier pursuit when part of the measurements are damaged by outliers. This method will detect the positions where the data is completely ruined and recover the matrix using correct measurements. Numerical experiments show the accuracy of noise detection and high performance of matrix completion for our algorithms compared with other algorithms.     

Design and analysis of robust fault detection filter using LMI tools

In this paper, the robust fault detection filter design problem for linear time invariant (LTI) systems with unknown inputs and modeling uncertainties is studied. The basic idea of our study is to formulate the robust fault detection filter design as a H_∞ model-matching problem. A solution of the optimal problem is then presented via a linear matrix inequality (LMI) formulation. The main results include the formulation of robust fault detection filter design problems, the derivation of a sufficient condition for the existence of a robust fault detection filter and construction of a robust fault detection filter based on the iterative of LMI algorithm.     

基于鲁棒加权模糊聚类的污水处理过程监测方法

针对非线性强、先验故障知识少、异常工况识别难的污水处理过程监测问题,提出一种基于鲁棒加权模糊c均值(Robust weighted fuzzy c-means, RoW-FCM)聚类与核偏最小二乘(Kernel partial least squares, KPLS)的过程监测方法.首先,针对污水处理过程的高维非线性耦合特性,采用核偏最小二乘对高维输入变量进行降维;其次,针对传统基于最近邻分配的模糊c均值算法对离群点敏感以及存在聚类不平衡簇的问题,提出充分考虑样本间相互关系的基于鲁棒加权模糊c均值聚类算法.通过引入可能性划分矩阵作为权值参数实现不同样本数据的区分加权,提高了离群点数据聚类的鲁棒性,同时引入聚类大小控制参数解决不平衡簇的问题.进一步将基于鲁棒加权模糊c均值算法对核偏最小二乘降维后的得分矩阵进行聚类,利用聚类得到的隶属度矩阵实现异常工况的检测;最后,建立隶属度矩阵与过程变量的回归模型,并利用得到的变量贡献矩阵描述变量对各个簇的解释程度,实现异常工况的识别.数值仿真以及污水处理过程数据实验表明该方法具有更好的鲁棒性能,在异常工况检测和识别上具有较好的效果.     

时滞依赖H∞滤波器的有限频故障检测方法

本文研究了线性离散时滞系统的有限频鲁棒故障检测问题.利用故障估计技术,将故障检测滤波器设计问题转化为时滞依赖的H∞滤波器设计问题.本文直接给出刻画有限频故障检测性能的线性矩阵不等式条件,避免因引入加权函数而产生的不准确性.最后,仿真算例表明时滞依赖的有限频故障检测滤波器可以取得比已有结果更好的故障检测性能.     

基于混杂系统方法的一类采样数据系统鲁棒故障检测

针对具有连续时间过程噪声和离散时间测量噪声的采样数据系统, 提出了一种新的鲁棒故障检测直接设计方法. 首先利用具有有限跳变的线性系统作为残差产生器, 采样数据系统的鲁棒故障检测设计问题被描述成采样数据滤波问题, 然后给出有限跳变线性系统有界实引理的线性矩阵不等式(LMI)表达形式, 基于此, 推导出采样数据系统鲁棒故障检测滤波器的存在条件及设计参数, 并将所提方法推广到具有结构不确定性的采样数据系统上. 所设计的滤波器能够保证残差与故障之间误差最小, 并对过程噪声、测量噪声、结构不确定性等因素鲁棒. 最后, 通过数值仿真对所提方法的可行性进行了验证.