An incremental algorithm about the affinity-rule based transductive learning machine for semi-supervised problem

Authors:
Weijiang Long;Fengfeng Zhu;Wenxiu Zhang
Affiliations:
Institute of Information and Systems, Faculty of Sciences, Xi'an Jiaotong, University, Xi'an;Department of Applied Mathematics, South China University of Technology, Guangzhou;Institute of Information and Systems, Faculty of Sciences, Xi'an Jiaotong, University, Xi'an
Venue:
Intelligent information processing II
Year:
2004

Citing 4
Cited 0

Semi-supervised support vector machines

Proceedings of the 1998 conference on Advances in neural information processing systems II
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
Transductive Inference for Text Classification using Support Vector Machines

ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Support vector clustering

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the central problems in machine learning is how to effectively combine unlabelled and labelled data to infer the labels of unlabelled ones. In recent years, there has a growing interest on the transduction method. In this article, the transductive learning machines are described based on a so-called affinity rule which comes from the intuitive fact that if two objects are close in input space then their outputs should also be close, to obtain the solution of semi-supervised learning problem. By using the analytic solution for this problem, an incremental learning algorithm adapting to on-line data processing is derived.