• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Transductive Inference for Text Classification using Support Vector Machines (1999)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.cs.wustl.edu]
  • [www-ai.cs.uni-dortmund.de]
  • [www-ai.informatik.uni-dortmund.de]
  • [www.joachims.org]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www-ai.cs.uni-dortmund.de]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Thorsten Joachims
Citations:509 - 4 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Joachims99transductiveinference,
    author = {Thorsten Joachims},
    title = {Transductive Inference for Text Classification using Support Vector Machines},
    booktitle = {},
    year = {1999},
    pages = {200--209},
    publisher = {Morgan Kaufmann}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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.

Citations

6694 Statistical Learning Theory - Vapnik - 1998
1459 An algorithm for suffix stripping - Porter - 1980
1368 Text categorization with support vector machines - Joachims - 1998
1216 Term-weighting approaches in automatic text retrieval - Salton, Buckley - 1988
1086 Making large-scale SVM learning practical - Joachims - 1999
946 Combining labeled and unlabeled data with co-training - Blum, Mitchell - 1998
739 A Comparative Study on Feature Selection in Text Categorization - Yang
619 Nigam K: A comparison of event models for naïve Bayes text classification - McCallum - 1998
419 Inductive learning algorithms and representations for text categorization - Dumais, Platt, et al. - 1998
285 A probabilistic analysis of the rocchio algorithm with tfidf for text categorization - Joachims - 1997
140 Learning to classify text from labeled and unlabeled documents - Nigam, McCallum, et al. - 1998
106 A theoretical basis for the use of co-occurrence data in information retrieval - Rijsbergen - 1977
67 A critical investigation of recall and precision as measures of retrieval system performance - Raghavan, Bollmann, et al. - 1989
65 Feature subset selection in text learning - Mladenic - 1998
51 Combining support vector and mathematical programming methods for classi cation - Bennett - 1999
50 Learning by transduction - Gammerman, Vapnik, et al. - 1998
30 An Algorithm for Su x Stripping - Porter - 1980
11 Theorie der Zeichenerkennung - Wapnik, Tscherwonenkis - 1979
7 On structural risk minimization or overall risk in a problem of pattern recognition. Automation and Remote Control - Vapnik, Sterin - 1977
1 On structural risk minimization oroverall risk in a problem of pattern recognition. Automation and Remote Control - Vapnik, Sterin - 1977
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University