返回
Lagrangean-Based Combinatorial Optimization for Large-Scale S3VMs
DOI:10.1109/TNNLS.2017.2766704.png)
摘要
En 中文
The process of manually labeling instances, essential to a supervised classifier, can be expensive and time-consuming. In such a scenario the semisupervised approach, which makes the use of unlabeled patterns when building the decision function, is a more appealing choice. Indeed, large amounts of unlabeled samples often can be easily obtained. Many optimization techniques have been developed in the last decade to include the unlabeled patterns in the support vector machines formulation. Two broad strategies are followed: continuous and combinatorial. The approach presented in this paper belongs to the latter family and is especially suitable when a fair estimation of the proportion of positive and negative samples is available. Our method is very simple and requires a very light parameter selection. Several medium- and large-scale experiments on both artificial and real-world data sets have been carried out proving the effectiveness and the efficiency of the proposed algorithm.
Keyword:
Lagrangean combinatorial heuristics
large-scale classification
semisupervised learning
support vector machines (SVMs)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.5K
被引数:
7.2W
机构
引用论文
Real-Time Analysis of a Modified State Observer for Sensorless Induction Motor Drive Used in Electric Vehicle Applications
Energies
IF0
Fast and simple gradient-based optimization for semi-supervised support vector machines
NEUROCOMPUTING
IF6.5
没有更多内容

