近邻渐进直推式支持向量机算法

针对渐进直推式支持向量机箅法训练速度慢和学习性能不稳定的问题,提出一种近邻渐进直推式支持向量机算法.该算法利用支持向量机中支持向量信息,选择支持向量附近的无标签样本点进行标注,采用支持向量预选取的方法减少训练集的规模,提高算法的速度.实验结果表明了该算法的有效性.     

基于半监督多示例学习的对象图像检索

针对基于对象的图像检索问题,提出一种新的半监督多示例学习(MIL)算法.该算法将图像当作包,分割区域的视觉特征当作包中的示例,按"点密度"最大原则,提取"视觉语义"构造投影空间;然后利用定义的非线性函数将包映射成投影空间中的一个点,以获得图像的"投影特征",并采用粗糙集(RS)方法对其进行属性约简;最后利用直推式支持向量机(TSVM)进行半监督的学习,得到分类器.实验结果表明,该方法有效且性能优于其他方法.     

FSVM在图像低层特征与高层语义关联中的应用

基于内容的图像检索中,针对图像的低层可视特征与高层语义特征之间的鸿沟,提出了一种新的基于模糊支持向量机(FSVM)的语义关联方法.重点分析了支持向量机语义关联中存在的误分、拒分现象,在传统支持向量机中引入模糊隶属度函数,解决了不可分区域问题.通过对图像低层特征的分析,提取了颜色和形状特征向量(221维),将它们作为模糊支持向量机的输入向量,对图像类进行学习,建立图像低层特征与高层语义的关联.并应用于鸟类、花卉、海洋以及建筑物等几个典型的语义类别检索,实验结果表明,该方法可适应于不同用户的图像检索,在相同的条件下可以达到比支持向量机方法更为理想的语义关联效果,提高了检索性能.     

直推式支持向量机在Web信息抽取中的应用研究

直推式支持向量机是一种直接从已知样本出发对特定的未知样本进行识别的分类技术。在分析直推式支持向量机分类原理的基础上,提出一种基于直推式支持向量机的Web信息抽取方法,直接从分类的角度抽取Web信息。只需要提供少量标记样本就可以实现对大量未标注样本的分类标注,从而以分类的方式完成Web数据抽取任务。实验结果表明,使用这种方法进行Web信息抽取是有效性。     

基于SVM的图像低层特征与高层语义的关联*

在基于内容的图像检索中,针对图像的低层可视特征与高层语义特征之间的鸿沟,提出了一种基于支持向量机(SVM)的语义关联方法。通过对图像低层特征的分析,提取了颜色和形状特征向量(221维),将它们作为支持向量机的输入向量,对图像类进行学习,建立图像低层特征与高层语义的关联,并应用于鸟类、花卉、海洋以及建筑物等几个典型的语义类别检索。实验结果表明,该方法可适应于不同用户的图像检索,并提高了检索性能。     

基于增量学习的直推式支持向量机算法

针对直推式支持向量机在进行大数据量分类时出现精度低、学习速度慢和回溯式学习多的问题,提出了一种基于增量学习的直推式支持向量机分类算法,将增量学习引入直推式支持向量机,使其在训练过程中仅保留有用样本而抛弃无用样本,从而减少学习时间,提高分类速度。实验结果表明,该算法具有较快的分类速度和较高的分类精度。     

结合模糊聚类与支持向量机的图像分割（英文）

提出一种新的混合的图像分割方法,利用模糊C均值聚类与支持向量机两种方法相结合。此方法首先将图像的空间分布信息作为支持向量机的特征分量,再用模糊C均值聚类获得的分类结果作为支持向量机所需的初始训练样本,并对图像的所有像素点进行分类,同一类中的像素点形成一个分割区域,以此获得图像分割。实验表明,此将模糊C均值与支持向量机结合的新方法获得的图像分割效果较好,在一定程度上解决了支持向量机特征维数过大所导致的维数灾难问题。     

双模糊渐进直推式支持向量机算法

直推式支持向量机(TSVM)是支持向量机与直推式学习相结合的重要算法.文中为TSVM中的临时标签样本引入双模糊隶属度以及样本修剪策略,构建一种双模糊渐进直推式支持向量机(BFPTSVM)算法.该算法可有效降低TSVM的计算复杂度及核存储量.模拟实验表明该算法可取得比其他算法更好的分类性能,并且具有较快的收敛速度.     

集成模糊LSA与MIL的图像分类算法

针对自然图像的分类问题,提出一种基于模糊潜在语义分析(LSA)与直推式支持向量机(TSVM)相结合的半监督多示例学习(MIL)算法.该算法将图像当作多示例包,分割区域的底层视觉特征当作包中的示例.为了将MIL问题转化成单示例问题进行求解,首先利用K-Means方法对训练包中所有的示例进行聚类,建立"视觉词汇表";然后根据"视觉字"与示例之间的距离定义模糊隶属度函数,建立模糊"词-文档"矩阵,再采用LSA方法获得多示例包(图像)的模糊潜在语义模型,并通过该模型将每个多示例包转化成单个样本;采用半监督的TSVM训练分类器,以利用未标注图像来提高分类精度.基于Corel图像库的对比实验结果表明,与传统的LSA方法相比,模糊LSA的分类准确率提高了5.6%,且性能优于其他分类方法.     

基于模糊支持向量机的面向语义图像检索算法*

为了缩减图像低层特征和高层语义之间的“语义鸿沟”,本文提出一种基于模糊支持向量机的面向语义图像检索(SBIR-FSVM)算法。在提取图像的低层特征的基础上,本文将最小隶属度模糊支持向量机引入到图像检索技术中,获取图像语义信息及消除传统支持向量机(SVM)在多类分类中产生的不可分区域,从而实现面向语义的图像检索。实验结果表明,本文提出的SBIR-FSVM算法与基于SVM的图像检索算法及综合多特征的基于内容的图像检索算法相比均有了显著的改进。     

基于支持向量机的渐进直推式分类学习算法

支持向量机(support vector machine)是近年来在统计学习理论的基础上发展起来的一种新的模式识别方法,在解决小样本、非线性及高维模式识别问题中表现出许多特有的优势.直推式学习(transductive inference)试图根据已知样本对特定的未知样本建立一套进行识别的方法和准则.较之传统的归纳式学习方法而言,直推式学习往往更具普遍性和实际意义.提出了一种基于支持向量机的渐进直推式分类学习算法,在少量有标签样本和大量无标签样本所构成的混合样本训练集上取得了良好的学习效果.     

Least Square Transduction Support Vector Machine

Support vector machine (SVM) is a general and powerful learning machine, which adopts supervised manner. However, for many practical machine learning and data mining applications, unlabeled training examples are readily available but labeled ones are very expensive to be obtained. Therefore, semi-supervised learning emerges as the times require. At present, the combination of SVM and semi-supervised learning principle such as transductive learning has attracted more and more attentions. Transductive support vector machine (TSVM) learns a large margin hyperplane classifier using labeled training data, but simultaneously force this hyperplane to be far away from the unlabeled data. TSVM might seem to be the perfect semi-supervised algorithm since it combines the powerful regularization of SVMs and a direct implementation of the clustering assumption, nevertheless its objective function is non-convex and then it is difficult to be optimized. This paper aims to solve this difficult problem. We apply least square support vector machine to implement TSVM, which can ensure that the objective function is convex and the optimization solution can then be easily found by solving a set of linear equations. Simulation results demonstrate that the proposed method can exploit unlabeled data to yield good performance effectively.     

KNN-based least squares twin support vector machine for pattern classification

The least squares twin support vector machine (LSTSVM) generates two non-parallel hyperplanes by directly solving a pair of linear equations as opposed to solving two quadratic programming problems (QPPs) in the conventional twin support vector machine (TSVM), which makes learning speed of LSTSVM faster than that of the TSVM. However, LSTSVM fails to discover underlying similarity information within samples which may be important for classification performance. To address the above problem, we apply the similarity information of samples into LSTSVM to build a novel non-parallel plane classifier, called K-nearest neighbor based least squares twin support vector machine (KNN-LSTSVM). The proposed method not only retains the superior advantage of LSTSVM which is simple and fast algorithm but also incorporates the inter-class and intra-class graphs into the model to improve classification accuracy and generalization ability. The experimental results on several synthetic as well as benchmark datasets demonstrate the efficiency of our proposed method. Finally, we further went on to investigate the effectiveness of our classifier for human action recognition application.     

基于TSVM的网络入侵检测研究

直推式支持向量机(TSVM) 是一种直接从已知样本出发对特定的未知样本进行识别和分类的技术。该文提出了基于TSVM的网络入侵检测系统模型，并用实验给出了它在网络入侵检测中的性能表现，分析了它与基于传统归纳式支持向量机(ISVM)的入侵检测系统的性能对比。实验结果表明，将TSVM应用到入侵检测是切实可行的。     

Building sparse twin support vector machine classifiers in primal space

Twin support vector machines (TSVM) obtain faster training speeds than classical support vector machines (SVM). However, TSVM augmented vectors lose sparsity. In this paper, a rapid sparse twin support vector machine (STSVM) classifier in primal space is proposed to improve the sparsity and robustness of TSVM. Based on a simple back-fitting strategy, the STSVM iteratively builds each nonparallel hyperplanes by adding one support vector (SV) from the corresponding class at one time. This process is terminated using an adaptive and stable stopping criterion. STSVM learning is implemented by linear equation computing systems through introducing a quadratic function to approximate the empirical risk. The computational results on several synthetic and benchmark datasets indicate that the STSVM obtains a sparse separating hyperplane at a low cost without sacrificing its generalization performance.     

一种基于MI-Simba算法的香烟烟雾识别方法*

香烟烟雾对环境条件敏感以及多特征间存在冗余,都导致无法在视频监控中准确进行烟雾识别,因此提出一种高维互信息与Simba特征加权相结合的算法(MI-Simba).首先采用视频特征提取方法获取烟雾统计度量特征、颜色布局特征和动态特征,构建初始特征向量;然后利用MI-Simba算法进行自动更新,构建该环境下最优特征组合;最后采用直推式支持向量机进行分类识别.针对室内和楼宇内场景,自建封闭空间吸烟视频数据集,采用5倍交叉策略进行比较验证,实验结果验证该算法在识别率和灵敏度两方面的有效性和优越性.     

一种基于显著点和SVM相关反馈的图像检索方法

针对传统基于全局特征的图像检索方法存在的不足,提出一种基于显著点特征和SVM(support vector machine)相关反馈相结合的图像检索方法.显著点提取方法是对图像进行小波分解,选择粗分辨率下绝对值较大的小波系数,它们对应原图像中变化较大的区域,然后在细分辨率下跟踪这些小波系数,提取原图像中的能代表这些变化的点,即显著点;然后利用显著点的空间分布信息,提取显著点周围局部区域的特征进行检索,并对检索结果进行SVM相关反馈.实验结果表明,引入反馈的方法可有效地检索更多的相关图像,明显提高了检索的准确性.     

Political Optimizer with Deep Learning-Enabled Tongue Color Image Analysis Model

Biomedical image processing is widely utilized for disease detection and classification of biomedical images. Tongue color image analysis is an effective and non-invasive tool for carrying out secondary detection at anytime and anywhere. For removing the qualitative aspect, tongue images are quantitatively inspected, proposing a novel disease classification model in an automated way is preferable. This article introduces a novel political optimizer with deep learning enabled tongue color image analysis (PODL-TCIA) technique. The presented PODL-TCIA model purposes to detect the occurrence of the disease by examining the color of the tongue. To attain this, the PODL-TCIA model initially performs image pre-processing to enhance medical image quality. Followed by, Inception with ResNet-v2 model is employed for feature extraction. Besides, political optimizer (PO) with twin support vector machine (TSVM) model is exploited for image classification process, shows the novelty of the work. The design of PO algorithm assists in the optimal parameter selection of the TSVM model. For ensuring the enhanced outcomes of the PODL-TCIA model, a wide-ranging experimental analysis was applied and the outcomes reported the betterment of the PODL-TCIA model over the recent approaches.     

Robust energy-based least squares twin support vector machines

Twin support vector machine (TSVM), least squares TSVM (LSTSVM) and energy-based LSTSVM (ELS-TSVM) satisfy only empirical risk minimization principle. Moreover, the matrices in their formulations are always positive semi-definite. To overcome these problems, we propose in this paper a robust energy-based least squares twin support vector machine algorithm, called RELS-TSVM for short. Unlike TSVM, LSTSVM and ELS-TSVM, our RELS-TSVM maximizes the margin with a positive definite matrix formulation and implements the structural risk minimization principle which embodies the marrow of statistical learning theory. Furthermore, RELS-TSVM utilizes energy parameters to reduce the effect of noise and outliers. Experimental results on several synthetic and real-world benchmark datasets show that RELS-TSVM not only yields better classification performance but also has a lower training time compared to ELS-TSVM, LSPTSVM, LSTSVM, TBSVM and TSVM.     

SVM-based active feedback in image retrieval using clustering and unlabeled data

In content-based image retrieval, relevance feedback is studied extensively to narrow the gap between low-level image feature and high-level semantic concept. However, most methods are challenged by small sample size problem since users are usually not so patient to label a large number of training instances in the relevance feedback round. In this paper, this problem is solved by two strategies: (1) designing a new active selection criterion to select images for user's feedback. It takes both the informative and the representative measures into consideration, thus the diversities between these images are increased while their informative powers are kept. With this new criterion, more information gain can be obtained from the feedback images; and (2) incorporating unlabeled images within the co-training framework. Unlabeled data partially alleviates the training data scarcity problem, thus improves the efficiency of support vector machine (SVM) active learning. Systematic experimental results verify the superiority of our method over existing active learning methods.