Semi-supervised Software Defect Prediction Using Task-Driven Dictionary Learning

We present a semi-supervised approach for software defect prediction.The proposed method is designed to address the special problematic characteristics of software defect datasets,namely,lack of labeled samples and class-imbalanced data.To alleviate these problems,the proposed method features the following components.Being a semi-supervised approach,it exploits the wealth of unlabeled samples in software systems by evaluating the confidence probability of the predicted labels,for each unlabeled sample.And we propose to jointly optimize the classifier parameters and the dictionary by a task-driven formulation,to ensure that the learned features (sparse code) are optimal for the trained classifier.Finally,during the dictionary learning process we take the different misclassification costs into consideration to improve the prediction performance.Experimental results demonstrate that our method outperforms several representative stateof-the-art defect prediction methods.     

A weakly supervised large margin domain adaptation method for isolated handwritten digit recognition

Learning handwriting categories fail to perform well when trained and tested on data from different databases. In this paper, we propose a novel large margin domain adaptation algorithm which is able to learn a transformation between training and test datasets in addition to adapting the parameters of classifier using a few or even no training labeled samples from target handwriting dataset. Additionally, we developed a framework of ensemble projection feature learning for datasets representation as a front end for our algorithm to utilize the abundant unlabeled samples in target domain. Experiments on different handwritten digit datasets adaptations demonstrate that the proposed large margin domain adaptation algorithm achieves superior classification accuracy comparing with the state of the art methods. Quantitative evaluation of the proposed algorithm shows that semi-supervised adaptation utilizing one sample per class of target domain set reduces the error rates by 64.72% comparing with a corresponding SVM classifier.     

A novel semi-supervised canonical correlation analysis and extensions for multi-view dimensionality reduction

Canonical correlation analysis (CCA) is an efficient method for dimensionality reduction on two-view data. However, as an unsupervised learning method, CCA cannot utilize partly given label information in multi-view semi-supervised scenarios. In this paper, we propose a novel two-view semi-supervised learning method, called semi-supervised canonical correlation analysis based on label propagation (LPbSCCA). LPbSCCA incorporates a new sparse representation based label propagation algorithm to infer label information for unlabeled data. Specifically, it firstly constructs dictionaries consisting of all labeled samples; and then obtains reconstruction coefficients of unlabeled samples using sparse representation technique; at last, by combining given labels of labeled samples, estimates label information for unlabeled ones. After that, it constructs soft label matrices of all samples and probabilistic within-class scatter matrices in each view. Finally, in order to enhance discriminative power of features, it is formulated to maximize the correlations between samples of the same class from cross views, while minimizing within-class variations in the low-dimensional feature space of each view simultaneously. Furthermore, we also extend a general model called LPbSMCCA to handle data from multiple (more than two) views. Extensive experimental results from several well-known datasets demonstrate that the proposed methods can achieve better recognition performances and robustness than existing related methods.     

原子-分子字典结合的联合扩展加权稀疏表示人脸识别算法

针对训练样本字典学习仅包含全局信息、缺乏局部信息的不足,引入与类别相关的原子字典, 提出基于原子与分子字典联合扩展的加权稀疏表示人脸识别方法。首先,对各类训练样本进行PCA学习,得到带标记的训练样本基,构造PCA基原子字典,同时将训练样本字典作为分子字典。进而,利用原子字典与分子字典结合得到扩展字典模型。测试时,根据测试样本与扩展字典基之间的距离进行加权得到与当前测试样本关联的重构字典集,最后对测试样本稀疏重构,利用残差进行分类判别。为验证本文方法有效性,分别在AR、Georgia Tech和CMU PIE人脸数据库上进行实验。      

多观测样本联合信息加权稀疏表示分类算法

多观测样本分类问题中,同一对象的多观测样本均看作一个整体进行识别,其同等看待各个观测样本。考虑到其每个观测样本包含判别信息量不同,针对如何有效利用其可信度问题,提出基于观测样本联合加权稀疏表示多观测样本分类算法。首先将多多观测样本分解成单样本,分别对各个样本进行稀疏求解得到其各自的稀疏度和残差,进而联合二者确定其相应可信度。然后给各观测样本进行可信度加权,重构出加权多观测样本。最后,再采用整体稀疏表示对其进行分类。在ETH-80物体数据库、CMU-PIE人脸数据库和BANCA数据库上进行大量对比实验,实验结果证明该算法的有效性,提高识别精度的同时使算法的鲁棒性得到保证。      

基于字典优化的联合稀疏表示高光谱图像分类

针对训练样本量少导致高光谱图像分类精度低的问题,本文提出了一种基于字典优化的联合稀疏表示高光谱图像分类方法.首先,采取基于层次聚类的波段选择方法降低高光谱图像数据维度;其次,结合空间信息将高光谱数据划分为多个子集,利用已知标签信息的训练样本标记各个子集中可能成为训练样本的像元,组成训练样本备选集,根据光谱相似度准则筛选...     

基于稀疏表示及光谱信息的高光谱遥感图像分类

该文结合稀疏表示及光谱信息提出了一种新的高光谱遥感图像分类算法。首先提出利用高光谱遥感图像数据集构造学习字典,然后根据学习字典计算每个像元的稀疏系数,从而获得像元的稀疏表示特征,最后根据稀疏表示特征和光谱信息分别构造随机森林,通过投票机制得到最终的分类结果。在AVIRIS高光谱遥感图像上的实验结果表明:该文所提方法能够提高分类效果,且其分类总精度和Kappa系数要高于光谱信息和稀疏表示特征方法。     

原子稀疏结合块结构稀疏的联合表示图像识别算法

针对结构稀疏表示识别算法中稀疏准则的选择以及字典内块的划分两个重要问题,提出两种改进的结构稀疏表示识别算法。首先,针对结构稀疏准则会出现较多系数不为零的情况,提出将结构稀疏准则与原子稀疏准则相结合的思路,包括并行和串行两种结合方式。并行结合是将两者以加权求和的方式同时作为稀疏表示的判别准则进行分类,串行结合则是在结构稀疏表示后,通过重组字典,再对测试样本进行原子稀疏表示实现分类。然后,针对字典中类内样本的块划分问题,提出基于MLP的结构稀疏表示识别算法,先将类内样本经过MLP的划分,保证各个分块分别位于低维的线性子空间中,再进行结构稀疏表示的分类。实验结果证明两种改进的结构稀疏表示识别算法的有效性。      

面向高光谱图像分类的半监督Laplace鉴别嵌入

为有效提取出高光谱遥感图像数据的鉴别特征,该文阐述一种融合标记样本中鉴别信息和无标记样本中局部结构信息的半监督Laplace鉴别嵌入(SSLDE)算法。该算法利用标记样本的类别信息来保持样本集的可分性,并通过构建标记样本和无标记样本的Laplace矩阵来发现样本集中局部流形结构,实现半监督的流形鉴别。在KSC 和Urban数据集上的实验结果说明:该算法具有更高的分类精度,可以有效地提取出鉴别特征信息。在总体分类精度上,该算法比半监督最大边界准则(SSMMC)算法提升了6.3%~7.4%,比半监督流形保持嵌入(SSSMPE)算法提升了1.6%~4.4%。     

基于结构化稀疏表达的高分辨率光学遥感图像的船只检测

为克服近岸船只检测中复杂港内背景干扰和基于深度学习算法的大视场光学遥感图像标注工作量大的困难,本文提出了基于小样本集的结构化稀疏表达方法来实现近岸船只检测的算法。构建由近岸船只目标,背景干扰信息和误差矩阵等三部分子字典组成的结构化稀疏表达字典,经小样本集的字典训练过程生成判别性稀疏编码。首先将多方向近岸船只目标样本与港内复杂背景信息样本经过HOG特征提取和PCA分析对原子进行初始化,然后使用K-SVD和LASSO算法对字典进行训练。在字典中引入误差矩阵对样本的类内差异进行表示,增强了稀疏编码的判别能力和系统鲁棒性。最后提出船只目标区域提取的置信度计算方法,对生成的结构化稀疏编码进行判别,提取船只目标区域,实现船只检测。通过对不同尺寸字典模型、引入误差矩阵前后的结构化稀疏表达模型进行实验,实验结果表明提出的引入误差矩阵的结构化稀疏表达方法的有效性,以及在小样本集下比现有技术方法具有更好的检测性能。      

Sparse representation for face recognition by discriminative low-rank matrix recovery

This paper proposes a discriminative low-rank representation (DLRR) method for face recognition in which both the training and test samples are corrupted owing to variations in occlusion and disguise. The proposed method extends the sparse representation-based classification algorithm by incorporating the low-rank structure of data representation. The DLRR algorithm recovers a clean dictionary with enhanced discrimination ability from the corrupted training samples for sparse representation. Simultaneously, it learns a low-rank projection matrix to correct corrupted test samples by projecting them onto their corresponding underlying subspaces. The dictionary elements from different classes are encouraged to be as independent as possible by regularizing the structural incoherence of the original training samples. This leads to a compact representation of a corrected test sample by a linear combination of more dictionary elements from the corrected class. The experimental results on benchmark databases show the effectiveness and robustness of our face recognition technique.     

类不均衡的半监督高斯过程分类算法

针对传统的监督学习方法难以解决真实数据集标记信息少、训练样本集中存在类不均衡的问题,提出了类不均衡的半监督高斯过程分类算法。算法引入自训练的半监督学习思想,结合高斯过程分类算法计算后验概率,向未标记数据中注入类标记以获得更多准确可信的标记数据,使得训练样本的类分布相对平衡,分类器自适应优化以获得较好的分类效果。实验结果表明,在类不均衡的训练样本及标记信息过少的情况下,该算法通过自训练分类器获得了有效标记,使分类精度得到了有效提高,为解决类不均衡数据分类提供了一个新的思路。     

一种快速低秩的判别子字典学习算法及图像分类

本文提出了一种快速低秩的判别子字典学习算法。在训练阶段,构造一个子字典的低秩约束项和拉普拉斯矩阵正则化项,加入判别字典学习的目标函数中。将原始样本映射到一个新的空间中,使同一类别的相邻点彼此靠近,同时增强子字典对同类样本的重构能力,针对每类样本的判别性特征,学习出相应的学习字典。在测试阶段,利用k NN分类器估计测试样本的类别标签。同时,将算法应用在3种数据集上,与其他的字典学习算法进行比较,取得了较好的分类结果。     

Face recognition using position-dictionaries and region covariance feature

In this paper, a new sparsity formulation called position-dictionary based sparse representation is developed for frontal face recognition. Different from the sparse representation based classification (SRC) method and the Gabor-feature based SRC (GSRC) method which both employ a global dictionary to decompose image patches, the proposed method constructs a position-dictionary for each location using training patches in the corresponding location since they resemble each other and are more likely to favor the same atoms. Sparse coefficients of each position-patch can be obtained by solving an \(l_{1}\) -norm minimization problem. For each face image, sparse coefficients of position-patches are pooled to construct a discriminative upper level feature to represent face image. PCA is used to perform dimension reduction. Each testing sample is represented as a sparse linear combination of all training samples, and recognition is accomplished by evaluating which class of training samples leads to the minimum reconstruction error. We compared the proposed method with SRC and GSRC method on three benchmark face databases. Experimental results show that the proposed method achieves higher recognition rates and is robust to a certain degree of occlusions.     

基于SSMFA与kNNS算法的高光谱遥感影像分类

 为了研究高光谱影像数据的维数约简和分类问题,提出了一种基于半监督边际费希尔分析(SSMFA)和kNNS的高光谱遥感影像数据分类算法.该方法利用有标记数据和无标记数据的信息获得数据的内在流形结构,通过SSMFA将高光谱数据从高维观测空间投影到低维流形空间,然后利用邻域内多个近邻点的信息通过kNNS分类器对低维空间中的数据进行分类.在Urban、Washington和Indian Pine数据集上的分类识别实验表明,该方法能够较为有效地发现高维空间中数据的内蕴结构,在每类随机选取4,6,8个有类别标记的样本10个无类别标记的样本的情况下,该方法的总体分类精度能够比MFA+kNNS提高0.8%~2.5%,比MFA+kNN提高2.8%~4.5%,比其他算法提高4.0%~7.0%,分类精度有了明显的提高.     

一种半监督稀疏保持近邻判别嵌入算法

保持近邻嵌入（NPE）算法对局部线性嵌入（LLE）算法进行了改进,克服了新来样本问题,但在处理分类问题上表现不足。本文提出了一种半监督稀疏保持近邻判别嵌入算法,该方法首先采用小波变换对数据进行预处理,然后执行等距离映射(Isomap)算法选择合适的低维嵌入维数,最后结合稀疏表示理论、NPE和线性判别分析（LDA）的思想,重构邻域图,并在建立目标函数时使得已标签信息中同类样本点之间相互靠近,异类样本点之间相互远离,未标签信息邻域信息得以保持,这样,既得到了高维映射函数,又提高了分类正确率。通过在人脸数据库上实验,并和其他半监督算法作比较,本文提出的算法在识别率上表现较好。     

熵权约束稀疏表示的短文本分类算法

针对短文本特征稀疏性问题,提出一种熵权约束稀疏表示的短文本分类方法.考虑到初始字典维数较高,首先,利用Word2vec工具将字典中的词表示成词向量形式,然后根据加权向量平均值对原始字典进行降维.其次,利用一种快速特征子集选择算法去除字典中不相关和冗余短文本,得到过滤后的字典.再次,基于稀疏表示理论在过滤后的字典上,为目标函数设计一种熵权约束的稀疏表示方法,引入拉格朗日乘数法求得目标函数的最优值,从而得到每个类的子空间.最后,在学习到的子空间下通过计算待分类短文本与每个类中短文本的距离,并根据三种分类规则对短文本进行分类.在真实数据集上的大量实验结果表明,本文提出的方法能够有效缓解短文本特征稀疏问题且优于现有短文本分类方法.     

基于块稀疏贝叶斯学习的SAR图像目标方位角估计方法

提出了一种基于块稀疏贝叶斯学习的合成孔径雷达（Synthetic aperture radar,SAR）图像目标方位角估计方法。SAR图像具有较强的方位角敏感性,因此对于具有某一方位角的SAR图像仅能与其具有相近方位角的样本具有较高的相关性。方法基于稀疏表示的基本思想,首先对所有训练样本按照方位角顺序排列为全局字典。在此条件下,待估计样本在该字典上的线性表示系数具有块稀疏特性,即非零表示系数主要聚集在字典上的某一局部区域。求解得到的块稀疏位置包含的训练样本可以有效地反映待估计样本的方位角信息。采用块稀疏贝叶斯学习（Block sparse Bayesian learning, BSBL）算法求解全局字典上的稀疏表示系数,并根据具有最小重构误差的原则获得最佳的局部分块。在获取最佳分块的基础上,方位角计算方法采用线性加权的方式综合了该分块区间内所有训练样本的方位角信息从而获得更为稳健的估计结果。所提出的方法在充分考察SAR图像方位角敏感性的基础上,综合运用局部区间内样本的有效信息,避免了基于单一样本估计的不确定性。为了验证所提出方法的有效性,基于Moving and stationary target acquisition and recognition （MSTAR）数据集进行了方位角估计实验并与几类经典方法进行对比分析。实验结果验证了所提出方法的性能优势。     

基于块分类稀疏表示的图像融合算法

针对基于单一字典训练稀疏表示的图像融合算法忽略图像局部特征的问题,提出了基于块分类稀疏表示的图像融合算法。此算法是根据图像局部特征的差异将图像块分为平滑、边缘和纹理三种结构类型,对边缘和纹理结构分别训练出各自的冗余字典。平滑结构利用算术平均法进行融合,边缘和纹理结构由对应字典利用稀疏表示算法进行融合,并对边缘结构稀疏表示中的残余量进行小波变换融合。实验结果证明,该算法相对于单一字典稀疏表示算法,在融合图像的主观评价和客观评价指标上都有显著改进,并且算法速度也有提高。     

A dynamic constraint representation approach based on cross-domain dictionary learning for expression recognition

Facial expression recognition (FER) is an active research area that has attracted much attention from both academics and practitioners of different fields. In this paper, we investigate an interesting and challenging issue in FER, where the training and testing samples are from a cross-domain dictionary. In this context, the data and feature distribution are inconsistent, and thus most of the existing recognition methods may not perform well. Given this, we propose an effective dynamic constraint representation approach based on cross-domain dictionary learning for expression recognition. The proposed approach aims to dynamically represent testing samples from source and target domains, thereby fully considering the feature elasticity in a cross-domain dictionary. We are therefore able to use the proposed approach to predict class information of unlabeled testing samples. Comprehensive experiments carried out using several public datasets confirm that the proposed approach is superior compared to some state-of-the-art methods.