1999 TransductiveInferenceForTextClass

From GM-RKB
Jump to navigation Jump to search

Subject Headings: Transductive Learning Algorithm, SVMlight.

Notes

  • It has won a 10-year paper award.

Cited By

2002

Quotes

Abstract

This paper introduces Transductive Support Vector Machines (TSVMs) for text classification. While regular Support Vector Machines (SVMs) try to induce a general decision function for a learning task, Transductive Support Vector Machines take into account a particular test set and try to minimize misclassifications of just those particular examples. The paper presents an analysis of why TSVMs are well suited for text classification. These theoretical findings are supported by experiments on three test collections. The experiments show substantial improvements over inductive methods, especially for small training sets, cutting the number of labeled training examples down to a twentieth on some tasks. This work also proposes an algorithm for training TSVMs efficiently, handling 10,000 examples and more.


References


,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
1999 TransductiveInferenceForTextClassThorsten JoachimsTransductive Inference for Text Classification using Support Vector MachinesProceedings of the International Conference on Machine Learninghttp://www.cs.cornell.edu/People/tj/publications/joachims 99c.pdf1999