返回
Safe transductive support vector machine
DOI:10.1080/09540091.2021.2024511.png)
摘要
En 中文
Since semi-supervised learning can use fewer labelled samples to train a better model, semi-supervised methods are becoming popular in data mining. As an important algorithm of semi-supervised support vector machines ((SVM)-V-3), transductive support vector machine (TSVM) sometimes may get worse models trained on both labelled samples and unlabelled samples than those trained only on labelled samples. To solve this problem, in this paper, we propose a safe TSVM (STSVM) based on the infinitesimal annealing algorithm. In the training of TSVM, we adopt the infinitesimal annealing and path following technology to approximate the step size of simulated annealing to balance the contradiction between annealing step and calculation time. During the annealing process, we call CP-step to update TSVM model with pseudo-labelled samples. If the current sample is on the boundary of combinatorial optimisation problem, SJ-step is called and a safety condition is designed to determine whether the sample needs to change its label or not, so as to ensure the TSVM model trained after changing is betterthan the model got before. The experimental results show that our STSVM algorithm can improve the accuracy of TSVM with a shorter running time, and is safer than the existing safe algorithms.
Keyword:
Semi-supervised learning method
safe algorithms
transductive support vector machine
path following technology
期刊
IF:
3.4
论文数:
854
被引数:
1.5K
机构
暂无机构信息
引用论文
A connectionist account of the relational shift and context sensitivity in the development of generalisation
CONNECTION SCIENCE
IF3.4
Semisupervised classification of hyperspectral images by SVMs optimized in the primal基于原始优化svm的高光谱图像半监督分类
Comparison of interpretations of a major landslide at an earthfill dam site in Papua New Guinea巴布亚新几内亚一处土石坝场址重大滑坡的解读比较
Deep transfer learning mechanism for fine-grained cross-domain sentiment classification面向细粒度跨域情感分类的深度迁移学习机制
CONNECTION SCIENCE
IF3.4

