Transductive Support Vector Machines Using Simulated Annealing
Transductive inference estimates classification function at samples within the test data using information from both the training and the test data set. In this paper, a new algorithm of transductive support vector machine is proposed to improve Joachims’ transductive SVM to handle various data distributions. Simulated annealing heuristic is used to solve the combinatorial optimization problem of TSVM, in order to avoid the problems of having to estimate the ratio of positive/negative samples and local optimum. The experimental result shows that TSVM-SA algorithm outperforms Joachims’ TSVM, especially when there is a significant deviation between the distribution of training and test data.
Unable to display preview. Download preview PDF.
- 1.Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines (2001), Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm
- 3.Gammerman, A., Vapnik, V., Vowk, V.: Learning by transduction. In: Conference on Uncertainty in Artificial Intelligence, pp. 148–156 (1998)Google Scholar
- 5.Joachims, T.: Transductive inference for text classification using support vector machines. In: International Conference on Machine Learning (ICML), pp. 200–209 (1999)Google Scholar