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.     

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

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

基于半监督学习的SVM-Wishart极化SAR图像分类方法

该文针对极化SAR (Synthetic Aperture Radar)图像分类中的小样本问题,提出了一种新的半监督分类算法。考虑到极化SAR数据反映了地物的散射特性,该方法首先利用目标分解方法提取了多种极化散射特征;其次,在协同训练框架下结合SVM分类器构建了协同半监督模型,该模型可以同时利用有标记和无标记样本对极化SAR图像进行分类,从而在小样本时可以获得更好的分类精度;最后,为进一步改善分类结果,在协同训练分类完成后,该方法又利用Wishart分类器对分类结果进行修正。理论分析与实验表明,该算法在只有少量标记样本的情况下优于传统算法。      

Location Estimation Based on Semi-Supervised Locally Linear Embedding (SSLLE) Approach for Indoor Wireless Networks

Location aware computing is popularized and location information use has important due to huge application of mobile computing devices and local area wireless networks. In this paper, we have proposed a method based on Semi-supervised Locally Linear Embedding for indoor wireless networks. Previous methods for location estimation in indoor wireless networks require a large amount of labeled data for learning the radio map. However, labeled instances are often difficult, expensive, or time consuming to obtain, as they require great efforts, meanwhile unlabeled data may be relatively easy to collect. So, the use of semi-supervised learning is more feasible. In the experiment 101 access points (APs) have been deployed so, the RSS vector received by the mobile station has large dimensions (i.e. 101). At first, we use Locally Linear Embedding to reduce the dimensions of data, and then we use semi-supervised learning algorithm to learn the radio map. The algorithm performs nonlinear mapping between the received signal strengths from nearby access points and the user??s location. It is shown that the proposed scheme has the advantage of robustness and scalability, and is easy in training and implementation. In addition, the scheme exhibits superior performance in the nonline-of-sight (NLOS) situation. Experimental results are presented to demonstrate the feasibility of the proposed SSLLE algorithm.     

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.     

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

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

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.     

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.     

Semi-Supervised Bilinear Subspace Learning

Recent research has demonstrated the success of tensor based subspace learning in both unsupervised and supervised configurations (e.g., 2-D PCA, 2-D LDA, and DATER). In this correspondence, we present a new semi-supervised subspace learning algorithm by integrating the tensor representation and the complementary information conveyed by unlabeled data. Conventional semi-supervised algorithms mostly impose a regularization term based on the data representation in the original feature space. Instead, we utilize graph Laplacian regularization based on the low-dimensional feature space. An iterative algorithm, referred to as adaptive regularization based semi-supervised discriminant analysis with tensor representation (ARSDA/T), is also developed to compute the solution. In addition to handling tensor data, a vector-based variant (ARSDA/V) is also presented, in which the tensor data are converted into vectors before subspace learning. Comprehensive experiments on the CMU PIE and YALE-B databases demonstrate that ARSDA/T brings significant improvement in face recognition accuracy over both conventional supervised and semi-supervised subspace learning algorithms.     

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

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

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.     

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

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

基于改进的半监督主动学习的雷达信号识别

为解决在雷达信号分类识别过程中训练样本较少的问题,本文提出了联合主动学习和半监督学习,并对其伪标记样本进行迭代验证改进的分类算法。针对复杂的电磁环境下雷达信号识别率低的问题,本文将径向高斯核时频分析应用于雷达信号,并对时频分布进行奇异值分解,提取出奇异向量作为雷达信号识别的特征参数。针对传统的半监督主动学习算法的不足,利用改进的半监督主动学习算法构建分类器,该算法通过对伪标记样本进行迭代验证来提高伪标记信息的准确性,从而改善了最终的分类性能,实现了在可获取的有标签样本数量较少的条件下对雷达信号的高概率识别。仿真结果表明,本文提出的特征识别方法可以获得较高的识别率。      

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.     

基于图的Co-Training网页分类

 本文充分利用网页数据的超链接关系和文本信息,提出了一种用于网页分类的归纳式半监督学习算法:基于图的Co-training网页分类算法(Graph based Co-training algorithm for web page classification),简称GCo-training,并从理论上证明了算法的有效性.GCo-training在Co-training算法框架下,迭代地学习一个基于由超链接信息构造的图的半监督分类器和一个基于文本特征的Bayes 分类器.基于图的半监督分类器只利用少量的标记数据,通过挖掘数据间大量的关系信息就可达到比较高的预测精度,可为Bayes分类器提供大量的标记信息;反过来学习大量标记信息后的Bayes分类器也可为基于图的分类器提供有效信息.迭代过程中,二者互相帮助,不断提高各自的性能,而后Bayes分类器可以用来预测大量未见数据的类别.在Web→KB数据集上的实验结果表明,与利用文本特征和锚文本特征的Co-training算法和基于EM的Bayes算法相比,GCo-training算法性能优越.     

Semi-supervised superpixel classification for medical images segmentation: application to detection of glaucoma disease

Glaucoma is a disease characterized by damaging the optic nerve head, this can result in severe vision loss. An early detection and a good treatment provided by the ophthalmologist are the keys to preventing optic nerve damage and vision loss from glaucoma. Its screening is based on the manual optic cup and disc segmentation to measure the vertical cup to disc ratio (CDR). However, obtaining the regions of interest by the expert ophthalmologist can be difficult and is often a tedious task. In most cases, the unlabeled images are more numerous than the labeled ones.We propose an automatic glaucoma screening approach named Super Pixels for Semi-Supervised Segmentation “SP3S”, which is a semi-supervised superpixel-by-superpixel classification method, consisting of three main steps. The first step has to prepare the labeled and unlabeled data, applying the superpixel method and bringing in an expert for the labeling of superpixels. In the second step, We incorporate prior knowledge of the optic cup and disc by including color and spatial information. In the final step, semi-supervised learning by the Co-forest classifier is trained only with a few number of labeled superpixels and a large number of unlabeled superpixels to generate a robust classifier. For the estimation of the optic cup and disc regions, the active geometric shape model is used to smooth the disc and cup boundary for the calculation of the CDR. The obtained results for glaucoma detection, via an automatic cup and disc segmentation, established a potential solution for glaucoma screening. The SP3S performance shows quantitatively and qualitatively similar correspondence with the expert segmentation, providing an interesting tool for semi-automatic recognition of the optic cup and disc in order to achieve a medical progress of glaucoma disease.     

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

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

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.     

一种基于证据理论的多类半监督分类算法

为了提高多类半监督分类的性能,提出了一种基于证据理论的多类协同森林算法（DSM-Co-Forest）.首先,通过"多对多"模式将有标记的多类数据随机拆分为多个二类数据集,并以此训练二类基分类器;然后,利用多个基分类器同时对未标记样本进行预测,并利用证据组合算法挑选出可信度较高的未标记样本;最后,将高可信度的未标记样本加入到原训练样本中,以迭代更新其他的基分类器,从而提高分类器的整体性能.通过在一些公共数据集上进行实验,并与其他半监督分类算法进行对比,验证了所提算法的可行性和有效性.     

RSS Fingerprints Based Distributed Semi-Supervised Locally Linear Embedding (DSSLLE) Location Estimation System for Indoor WLAN

An important requirement for many novel location based services, is to determine the locations of people, equipment, animals, etc. The accuracy and response time of estimation are critical issues in location estimation system. Most of the location estimation system suffers with the problem of scalability and unavailability of all the access points at all the location for large site. In this paper, we have proposed a distributed semi-supervised location estimation method, which divide the location estimation system into subsystems. Our method partition the input signal space and output location space into clusters on the basis of visibility of access points at various locations of the site area. Each cluster of input signal space together with output location subspace is used to learn the association between Received Signal Strength fingerprint and their respective location in a subsystem. Previous methods for location estimation in indoor wireless networks require a large amount of labeled data for learning the radio map. However, labeled instances are often difficult, expensive, or time consuming to obtain, as they require great efforts, meanwhile unlabeled data may be relatively easy to collect. So, the use of semi-supervised learning is more feasible. On each subsystem at first, we use Locally Linear Embedding to reduce the dimensions of data, and then we use semi-supervised learning algorithm to learn the radio map. The algorithm performs nonlinear mapping between the received signal strengths from nearby access points and the user’s location. It is shown that the proposed Distributed Semi-Supervised Locally Linear Embedding scheme has the advantage of robustness, scalability, useful in large site application and is easy in training and implementation. We have compared our results with Distributed Subtract on Negative Add on Positive (DSNAP) and benchmark method RADAR. Experimental results show that our method provide better results in terms of accuracy and response time in comparison to centralized systems, in which a single system is used for large site as well as with DSNAP and benchmark method RADAR.