一种基于多图的集成直推分类方法

基于图的直推分类器依赖于图结构。高维数据通常具有冗余和噪声特征,在其上构造的图不能充分反映数据的分布信息,分类器性能因此下降。为此,该文提出一种多图构建方法并把它应用到直推分类中。该方法首先生成多个随机子空间并在每个子空间上进行半监督判别分析,其次在每个判别子空间上构造图并训练一个直推分类器,最后投票融合这些分类器为一个集成分类器。实验结果表明,对比其它直推分类器,该文的集成分类器具有分类正确率高、对参数鲁棒等特点。     

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

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

一种增强差异性的半监督协同分类算法

半监督学习中的Tri-Training算法打破了以往算法对充分冗余视图的限制,并通过利用三个分类器处理标记置信度和样本预测问题提高了标记效率.为进一步增强协同训练过程中分类器之间的差异性以提高性能,本文在其理论基础上提出了一种增强差异性的半监督协同分类算法.该算法利用三个不同的分类器进行学习;考虑到分类模型在更新过程中,可能会因随机抽样导致性能恶化,该算法利用基于标记类别的分层抽样法来对已标记样本集进行抽样,并通过基于分类正确率的加权投票法实现了分类器的集成,提高了预测准确率.本文通过实验对所提出算法与Tri-Training算法做了性能比较,实验结果表明本文所提出的方法在分类问题上具有较好的性能,验证了该算法的有效性和可行性.     

基于Spark的分层子空间权重树随机森林算法

高维数据的很多特征与类别的相关性弱,影响了随机森林的分类正确率。针对原始随机森林算法在高维数据上的分类问题,提出了一种分层子空间权重树随机森林算法。同时,传统的单机模式无法满足高维数据计算效率的需求,因此利用开源集群计算框架Spark在内存缓存和迭代计算上的优势,将所提算法在Spark上实现。所提算法采用以决策树为单位的分层抽样来生成特征子空间,在提高单棵决策树性能的同时,保证决策树之间的多样性;并且采用权重树的集成策略,使分类能力强的树在集成过程中影响力更大。通过在Mnist和Gisette数据集上的实验结果表明,相比原始随机森林算法、TWRF算法以及分层子空间随机森林算法,所提算法具有更好的正确率,提高了泛化误差性能,可扩展性良好,能够有效分类高维数据。      

基于半监督学习的Web页面内容分类技术研究

针对如何使用标记和未标记数据进行Web分类这一关键性问题,探索一种生成模型和判别模型相互结合的分类器,在无标记训练集中采用最大似然估计,构造一种具有良好分类性能的半监督分类器。利用狄利克雷-多项式混合分布对文本进行建模,提出了适用于半监督学习的混合模型。针对半监督学习的EM算法收敛速度过快,容易陷入局部最优的难题,引入两种智能优化的方法——模拟退火算法和遗传算法进行分析和处理,结合这两种算法形成一种新型智能的半监督分类算法,并且验证了该算法的可行性。     

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

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

基于半监督多视图特征协同训练的网络恶意流量识别方法

针对恶意流量样本特征变化较快,准确标记困难的问题,提出了一种基于半监督多视图特征协同训练的网络恶意流量识别方法.该方法能够使用大量的未标记数据协同训练分类模型,提升分类模型的泛化能力.使用原始字节流特征和网络流统计特征,构建两种特征视图,借助协同训练框架进行半监督的恶意流量识别.分别使用两个公开数据集对模型训练和测试,...     

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

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

基于子空间半监督学习线性判别方法的目标跟踪技术研究

文中提出一种基于半监督学习的线性判别方法用于目标跟踪。首先,根据少量的目标图像和背景图像样本,利用增量线性判别分析在子空间中找到最大化标记样本分类间隔的分类面;然后在当前帧采样,获得大量未标记的图像样本并投影到子空间中,通过半监督学习修正分类面,在这些候选目标中找到离目标最近、离背景最远的作为目标在当前帧的状态估计;最后,在分类结果中挑选置信度高的目标图像和背景图像样本加入到训练集中,删除训练集中置信度低的目标图像和背景图像样本,并更新投影子空间的基。实验结果表明,所提方法可以很好地适应目标的各种变化,并获得比基于监督学习方法更好的效果。     

特征选择与深度学习相结合的极化SAR图像分类

给出了一种特征选择与深度学习相结合的极化合成孔径雷达(polarimetric synthetic aperture radar, PolSAR)图像有监督分类算法。该算法首先根据极化SAR图像数据以及目标分解获取原始特征参数集,然后利用随机森林(Random Forest, RF)方法对特征参数集进行重要性评估,并根据特征重要性排名选择最优极化特征。以最优极,化特征为输入,通过卷积神经网络(convolutional neural network, CNN)学习多层特征信息,再利用训练好的网络模型对极化SAR图像进行分类。利用美国AIRSAR机载系统采集的实测数据进行实验,并同已有经典有监督分类算法进行比较,结果表明本文算法能够选取有效的极化特征,最终得到较为准确的分类效果。      

改进的协同训练框架下压缩跟踪

针对基于传统协同训练框架的视觉跟踪算法在复杂环境下鲁棒性不足,该文提出一种改进的协同训练框架下压缩跟踪算法。首先,利用空间布局信息,基于能量熵最大化的在线特征选择技术提升压缩感知分类器的判别能力,分别在灰度空间和局部二值模式空间建立起基于结构压缩特征的两个独立分类器。然后,基于候选样本信任度分布熵的分类器联合机制实现互补性特征的自适应融合,增强跟踪结果的鲁棒性。最后,在级联的梯度直方图分类器辅助下,通过具备样本选择能力的新型协同训练准则完成联合外观模型的准确更新,解决了协同训练误差的积累问题。对大量具有挑战性的序列的对比实验结果验证了该算法相比于其它近似跟踪算法具有更优的性能。     

基于在线半监督boosting的协同训练目标跟踪算法

基于自训练的判别式目标跟踪算法使用分类器的预测结果更新分类器自身,容易累积分类错误,从而导致漂移问题。为了克服自训练跟踪算法的不足,该文提出一种基于在线半监督boosting的协同训练目标跟踪算法(简称Co-SemiBoost),其采用一种新的在线协同训练框架,利用未标记样本协同训练两个特征视图中的分类器,同时结合先验模型和在线分类器迭代预测未标记样本的类标记和权重。该算法能够有效提高分类器的判别能力,鲁棒地处理遮挡、光照变化等问题,从而较好地适应目标外观的变化。在若干个视频序列的实验结果表明,该算法具有良好的跟踪性能。     

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.     

Co-transduction for shape retrieval

In this paper, we propose a new shape/object retrieval algorithm, namely, co-transduction. The performance of a retrieval system is critically decided by the accuracy of adopted similarity measures (distances or metrics). In shape/object retrieval, ideally, intraclass objects should have smaller distances than interclass objects. However, it is a difficult task to design an ideal metric to account for the large intraclass variation. Different types of measures may focus on different aspects of the objects: for example, measures computed based on contours and skeletons are often complementary to each other. Our goal is to develop an algorithm to fuse different similarity measures for robust shape retrieval through a semisupervised learning framework. We name our method co-transduction, which is inspired by the co-training algorithm. Given two similarity measures and a query shape, the algorithm iteratively retrieves the most similar shapes using one measure and assigns them to a pool for the other measure to do a re-ranking, and vice versa. Using co-transduction, we achieved an improved result of 97.72% (bull's-eye measure) on the MPEG-7 data set over the state-of-the-art performance. We also present an algorithm called tri-transduction to fuse multiple-input similarities, and it achieved 99.06% on the MPEG-7 data set. Our algorithm is general, and it can be directly applied on input similarity measures/metrics; it is not limited to object shape retrieval and can be applied to other tasks for ranking/retrieval.     

Robust vision tracking by online random ferns and template library

In this paper, we proposed a robust tracking algorithm with an appearance model based on random ferns and template library. We adopt random Gaussian difference to generate binary features which depend on two randomly selected points and their corresponding Gaussian blur kernels. Semi-naive Bayes based random ferns are adopted as the discriminative model, and a template library including both positive templates and negative templates is used as generative model, the co-training of both discriminative and generative models gives our tracker the ability to separate foreground and background samples accurately. Besides, we also come up with a fragment based method which combines global ferns and local ferns to handle the occlusion problem. Experimental results demonstrated that the proposed algorithm performs well in terms of accuracy and robustness.     

A self‐learning stream classifier for flow‐based botnet detection

Botnets have been recently recognized as one of the most formidable threats on the Internet. Different approaches have been designed to detect these types of attacks. However, as botnets evolve their behavior to mislead the signature‐based detection systems, learning‐based methods may be deployed to provide a generalization capacity in identifying unknown botnets. Developing an adaptable botnet detection system, which incrementally evolves with the incoming flow stream, remains as a challenge. In this paper, a self‐learning botnet detection system is proposed, which uses an adaptable classification model. The system uses an ensemble classifier and, in order to enhance its generalization capacity, updates its model continuously on receiving new unlabeled traffic flows. The system is evaluated with a comprehensive data set, which contains a wide variety of botnets. The experiments demonstrate that the proposed system can successfully adapt in a dynamic environment where new botnet types are observed during the system operation. We also compare the system performance with other methods.     

概念级误用检测系统的认知能力研究

无法检测到未知攻击以及不能自动更新知识库是现有误用检测系统的两大缺点.概念级误用检测系统(CLMDS)中利用SRRW特征选取算法、CHGL技术和独立双模型互训练结构极大地提升了系统的认知能力,有效地解决了上述问题.文章从静态和动态两个层面对系统的认知能力进行了分析;实验结果表明:CLMDS具有很强的认知能力,不但能检测到未知的攻击样式,而且还能实现知识库的自动更新.     

神经网络在通信网控制中的应用

介绍神经网络解决ＡＴＭ通信网中业国质量控制的一种学习方法。以呼叫管理控制为例，评估这种网络控制中的性能，并给同了模拟结果。结果表明：使用神经网络的学习控制方法实现的控制器可自适应地控制特征不断变化的ＡＴＭ通信网。