Semi-supervised low-rank representation for image classification

Low-rank representation (LRR) is a useful tool for seeking the lowest rank representation among all the coefficient matrices that represent the images as linear combinations of the basis in the given dictionary. However, it is an unsupervised method and has poor applicability and performance in real scenarios because of the lack of image information. In this paper, based on LRR, we propose a novel semi-supervised approach, called label constrained sparse low-rank representation (LCSLRR), which incorporates the label information as an additional hard constraint. Specifically, this paper develops an optimization process in which the improvement of the discriminating power of the low-rank decomposition is presented explicitly by adding the label information constraint. We construct LCSLRR-graph to represent data structures for semi-supervised learning and provide the weights of edges in the graph by seeking a low-rank and sparse matrix. We conduct extensive experiments on publicly available databases to verify the effectiveness of our novel algorithm in comparison to the state-of-the-art approaches through a set of evaluations.     

Indoor localization via -graph regularized semi-supervised manifold learning

In this paper,a new l1-graph regularized semi-supervised manifold learning(LRSML) method is proposed for indoor localization.Due to noise corruption and non-linearity of received signal strength(RSS),traditional approaches always fail to deliver accurate positioning results.The l1-graph is constructed by sparse representation of each sample with respect to remaining samples.Noise factor is considered in the construction process of l1-graph,leading to more robustness compared to traditional k-nearest-neighbor graph(KNN-graph).The KNN-graph construction is supervised,while the l1-graph is assumed to be unsupervised without harnessing any data label information and uncovers the underlying sparse relationship of each data.Combining KNN-graph and l1-graph,both labeled and unlabeled information are utilized,so the LRSML method has the potential to convey more discriminative information compared to conventional methods.To overcome the non-linearity of RSS,kernel-based manifold learning method(K-LRSML) is employed through mapping the original signal data to a higher dimension Hilbert space.The efficiency and superiority of LRSML over current state of art methods are verified with extensive experiments on real data.     

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.     

代价敏感的半监督Laplacian支持向量机

代价敏感学习是机器学习领域的一个研究热点.在实际应用中,数据集往往是不平衡的,存在着大量的无标签样本,只有少量的有标签样本,并且存在噪声.虽然针对该情况的代价敏感学习方法的研究已取得了一定的进展,但还需要进一步的深入研究.为此,本文提出了一种基于代价敏感的半监督Laplacian支持向量机.该模型在采用无标签扩展策略的基础上,将考虑了数据不平衡的错分代价融入到Laplacian支持向量机的经验损失和Laplacian正则化项中.考虑到噪声样本对决策平面的影响,本文定义了一种样本依赖的代价,对噪声样本赋予较低的权重.在7个UCI数据集和8个NASA软件数据集上的实验结果表明了本文算法的有效性.     

Semi-supervised classification via discriminative sparse manifold regularization

In this paper, a newly semi-supervised manifold learning algorithm named Discriminative Sparse Manifold Regularization (DSMR) is proposed. In DSMR, the whole unlabeled sample set is used to reconstruct the mean vector of each class, then obtains the sparse coefficient. For each sample of labeled samples, the new dictionary is composed of samples from the same class and the samples from the unlabeled sample set according to the corresponding rows of the sparse coefficient. For each unlabeled sample, the new dictionary is composed of samples from the whole unlabeled samples and the samples from the labeled class according to the corresponding columns of the sparse coefficient. Additionally, a discriminative term is added to stabilize performance of the algorithm. Extensive experiments on the several UCI datasets and face datasets demonstrate the effectiveness of the proposed DSMR.     

Support vector machine active learning by Hessian regularization

It is time-consuming and expensive to gather and label the growing multimedia data that is easily accessible with the prodigious development of Internet technology and digital sensors. Hence, it is essential to develop a technique that can efficiently be utilized for the large-scale multimedia data especially when labeled data is rare. Active learning is showing to be one useful approach that greedily chooses queries from unlabeled data to be labeled for further learning and then minimizes the estimated expected learning error. However, most active learning methods only take into account the labeled data in the training of the classifier. In this paper, we introduce a semi-supervised algorithm to learn the classifier and then perform active learning scheme on top of the semi-supervised scheme. Particularly, we employ Hessian regularization into support vector machine to boost the classifier. Hessian regularization exploits the potential geometry structure of data space (including labeled and unlabeled data) and then significantly leverages the performance in each round. To evaluate the proposed algorithm, we carefully conduct extensive experiments including image segmentation and human activity recognition on popular datasets respectively. The experimental results demonstrate that our method can achieve a better performance than the traditional active learning methods.     

基于半监督稀疏流形嵌入的高光谱影像特征提取

高光谱影像具有波段数多、冗余度高的特点,因此特征提取成为高光谱影像分类的研究热点。针对此问题,该文提出一种半监督稀疏流形嵌入(S3ME)算法,该方法充分利用标记样本和无标记样本,通过基于切空间的稀疏流形表示来自适应地揭示数据间的相似关系,并利用稀疏系数构建一个半监督相似图。在此基础上,增加了图中同类标记样本的权重,然后在低维空间中保持图的相似关系不变,并最小化加权距离和,获得投影矩阵实现特征提取。S3ME方法不仅能揭示数据间的稀疏流形结构,而且增强了同类数据的集聚性,能有效提取出鉴别特征,改善分类效果。该文提出的S3ME方法在PaviaU和Salinas高光谱数据集上的总体分类精度分别达到84.62%和88.07%,相比传统特征提取方法提升了地物分类性能。     

改进自训练模型在业务质差用户识别中的应用

质差用户识别是降低用户投诉率、提升用户满意度的重要环节。针对当前电信网络系统中业务感知相关的大量结构化及非结构化数据难以有效标注、质差用户标签不完备、现有监督学习模型训练样本不均衡而导致质差识别率低的问题,采用改进自训练半监督学习模型,利用少量满意度低分和投诉用户作为质差用户标签对网络数据进行标注,并通过标签迁移对大量未标注数据进行训练识别质差用户。实验表明,相比于识别准确率高但是训练成本高的全监督学习和识别准确率低的无监督学习,半监督学习可以充分利用无标签样本数据进行有效训练,保证较低训练成本的同时显著提升质差用户识别准确率。     

红外目标检测网络改进半监督迁移学习方法

针对红外数据集规模小,标记样本少的特点,提出了一种红外目标检测网络的半监督迁移学习方法,主要用于提高目标检测网络在小样本红外数据集上的训练效率和泛化能力,提高深度学习模型在训练样本较少的红外目标检测等场景当中的适应性。文中首先阐述了在标注样本较少时无标注样本对提高模型泛化能力、抑制过拟合方面的作用。然后提出了红外目标检测网络的半监督迁移学习流程:在大量的RGB图像数据集中训练预训练模型,后使用少量的有标注红外图像和无标注红外图像对网络进行半监督学习调优。另外,文中提出了一种特征相似度加权的伪监督损失函数,使用同一批次样本的预测结果相互作为标注,以充分利用无标注图像内相似目标的特征分布信息;为降低半监督训练的计算量,在伪监督损失函数的计算中,各目标仅将其特征向量邻域范围内的预测目标作为伪标注。实验结果表明,文中方法所训练的目标检测网络的测试准确率高于监督迁移学习所获得的网络,其在Faster R-CNN上实现了1.1%的提升,而在YOLO-v3上实现了4.8%的显著提升,验证了所提出方法的有效性。     

Semi-supervised radio transmitter classification based on elastic sparsity regularized SVM

Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.     

基于子空间类标传播和正则判别分析的单标记图像人脸识别

针对单标记图像人脸识别问题,该文提出一种基于子空间类标传播和正则判别分析的半监督维数约简方法。首先,基于子空间假设设计了一种类标传播方法,将类标信息传播到无类标样本上。然后,在传播得到的带类标数据集上使用正则判别分析对数据进行维数约简。最后,在低维空间使用最近邻方法对测试人脸完成识别。在3个公共人脸数据库CMU PIE, Extended Yale B和AR上的实验,验证了该方法的可行性和有效性。     

基于单分类支持向量机和主动学习的网络异常检测研究

对基于支持向量机和主动学习的异常检测方法进行了研究,首先利用原始数据采用无监督方式建立单分类支持向量机模型,然后结合主动学习找出对提高异常检测性能最有价值的样本进行人工标记,利用标记数据和无标记数据以半监督方式对基于单分类支持向量机的异常检测模型进行扩展。实验结果表明,所提方法能够利用少量标记数据获取性能提升,并能够通过主动学习减小人工标记代价,更适用于实际网络环境。     

基于半监督协同训练的无人机对地目标跟踪

由于目标小、可区分性差,无人机对地目标跟踪较传统视频目标跟踪更容易丢失目标,提出一种基于l1图半监督协同训练的目标跟踪算法。算法首先提取样本的颜色和纹理特征构建两个充分冗余的视图,再以基于l1图的半监督学习算法取代传统协同训练中的监督学习方法构建单视图中的分类器,提高有限标记样本条件下的分类正确率,然后通过基于负类学习的协同训练算法协同更新两个视图的分类器,最后根据不同视图的相似度分布熵融合各分类器的分类结果实现目标跟踪。实验结果表明,该算法能够有效提高分类器的判别能力,具有良好的跟踪性能。     

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

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

Weakly supervised learning based on hypergraph manifold ranking

Significant challenges still remain despite the impressive recent advances in machine learning techniques, particularly in multimedia data understanding. One of the main challenges in real-world scenarios is the nature and relation between training and test datasets. Very often, only small sets of coarse-grained labeled data are available to train models, which are expected to be applied on large datasets and fine-grained tasks. Weakly supervised learning approaches handle such constraints by maximizing useful training information in labeled and unlabeled data. In this research direction, we propose a weakly supervised approach that analyzes the dataset manifold to expand the available labeled set. A hypergraph manifold ranking algorithm is exploited to represent the contextual similarity information encoded in the unlabeled data and identify strong similarity relations, which are taken as a path to label expansion. The expanded labeled set is subsequently exploited for a more comprehensive and accurate training process. The proposed model was evaluated jointly with supervised and semi-supervised classifiers, including Graph Convolutional Networks. The experimental results on image and video datasets demonstrate significant gains and accurate results for different classifiers in diverse scenarios.     

主动学习半监督聚类入侵检测算法

针对聚类的入侵检测算法误报率高的问题,提出一种主动学习半监督聚类入侵检测算法.在半监督聚类过程中应用主动学习策略,主动查询网络中未标记数据与标记数据的约束关系,利用少量的标记数据生成正确的样本模型来指导大量的未标记数据聚类,对聚类后仍未能标记的数据采用改进的K-近邻法进一步确定未标记数据的类型,实现对新攻击类型的检测.实验结果表明了算法的可行性及有效性.     

时变转速下基于改进图注意力网络的轴承半监督故障诊断

新近的基于图神经网络(GNN)的轴承半监督故障诊断研究仍存在标签信息挖掘不充分和诊断场景较理想等问题。工程实际中,轴承经常运行于启停等时变转速工况,且故障标签样本的获取成本越发昂贵。针对以上挑战,该文提出时变转速下基于改进图注意力网络(GAT)的轴承半监督故障诊断新方法。基于K最近邻(KNN)算法和平滑假设(SA)设计伪标签传播策略,将标签信息沿边传播给分布相似的邻域样本,从而充分利用有限样本的标签信息。将每个振动频谱样本视为一个节点,构建基于节点级图注意力网络的半监督学习模型,通过注意力机制进一步挖掘代表性的轴承故障特征。将所提方法用于分析两组时变转速下轴承故障实验数据,结果表明所提方法能够在不超过2%的低标签率情况下,准确诊断轴承的不同故障模式,性能优于其他常用的图神经网络半监督学习方法。     

Multimedia annotation via semi-supervised shared-subspace feature selection

With the rapid development of social network and computer technologies, we always confront with high-dimensional multimedia data. It is time-consuming and unrealistic to organize such a large amount of data. Most existing methods are not appropriate for large-scale data due to their dependence of Laplacian matrix on training data. Normally, a given multimedia sample is usually associated with multiple labels, which are inherently correlated to each other. Although traditional methods could solve this problem by translating it into several single-label problems, they ignore the correlation among different labels. In this paper, we propose a novel semi-supervised feature selection method and apply it to the multimedia annotation. Both labeled and unlabeled samples are sufficiently utilized without the need of graph construction, and the shared information between multiple labels is simultaneously uncovered. We apply the proposed algorithm to both web page and image annotation. Experimental results demonstrate the effectiveness of our method.     

基于最佳样本标记的主动支持向量机学习策略

支持向量机通过随机选择标记的训练样本进行有监督学习,随着信息容量的增加和数据收集能力的提高,这需要耗费大量的标记工作量,给实际应用带来不少困难.本文提出了基于最佳样本标记的主动支持向量机学习策略:首先利用无监督聚类选择一个小规模的样本集进行标记,然后训练该标记样本集得到一个初始SVM分类器,然后利用该分类器主动选择最感兴趣的无标记样本进行标记,逐渐增加标记样本的数量,并在此基础上更新分类器,反复进行直到得到最佳性能的分类器.实验结果表明在基本不影响分类精度的情况下,主动学习选择的标记样本数量大大低于随机选择的标记样本数量,这大大降低了标记的工作量,而且训练速度同样有所提高.     

Cooperative sparse representation in two opposite directions for semi-supervised image annotation

Recent studies have shown that sparse representation (SR) can deal well with many computer vision problems, and its kernel version has powerful classification capability. In this paper, we address the application of a cooperative SR in semi-supervised image annotation which can increase the amount of labeled images for further use in training image classifiers. Given a set of labeled (training) images and a set of unlabeled (test) images, the usual SR method, which we call forward SR, is used to represent each unlabeled image with several labeled ones, and then to annotate the unlabeled image according to the annotations of these labeled ones. However, to the best of our knowledge, the SR method in an opposite direction, that we call backward SR to represent each labeled image with several unlabeled images and then to annotate any unlabeled image according to the annotations of the labeled images which the unlabeled image is selected by the backward SR to represent, has not been addressed so far. In this paper, we explore how much the backward SR can contribute to image annotation, and be complementary to the forward SR. The co-training, which has been proved to be a semi-supervised method improving each other only if two classifiers are relatively independent, is then adopted to testify this complementary nature between two SRs in opposite directions. Finally, the co-training of two SRs in kernel space builds a cooperative kernel sparse representation (Co-KSR) method for image annotation. Experimental results and analyses show that two KSRs in opposite directions are complementary, and Co-KSR improves considerably over either of them with an image annotation performance better than other state-of-the-art semi-supervised classifiers such as transductive support vector machine, local and global consistency, and Gaussian fields and harmonic functions. Comparative experiments with a nonsparse solution are also performed to show that the sparsity plays an important role in the cooperation of image representations in two opposite directions. This paper extends the application of SR in image annotation and retrieval.