We show how the concave-convex procedure can be applied to transductive SVMs, which tradition- ally require solving a combinatorial search problem.

Abstract. We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem. This ...

Apr 26, 2017 · In this paper, we propose a robust and fast transductive support vector machine (RTSVM) classifier that can be applied to large-scale data.

Abstract. We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem. This ...

Abstract. We show how the Concave-Convex Procedure can be applied to Transductive SVMs, which traditionally requires solving a combinatorial search problem.

We show how the Concave-Convex Procedure can be applied to Transductive SVMs, which traditionally requires solving a combinatorial search problem.

We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem.

Abstract: We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem.

An implementation of Transductive SVM (TSVM) that is significantly more efficient and scalable than currently used dual techniques, for linear ...

We conduct experiments on the feature selection competition tasks to demonstrate the performance of Transductive SVMs in feature selection and classification.