BibSonomy :: bibtex  ::

tag user group author concept BibTeX key search:all search:dbenz_test
A blue social bookmark and publication sharing system.
tags · relations · groups · popular
help · blog · about
login · register
dbenz_test's BibTeX entry:  

Transductive Inference for Text Classification using Support Vector Machines

Proceedings of {ICML}-99, 16th International Conference on Machine Learning, : 200--209, 1999.
Authors: Thorsten Joachims
Editors: Ivan Bratko and Saso Dzeroski
URL: /brokenurl#joachims99.ps
Tags: eventually_useful studienarbeit
Abstract: This paper introduces Transductive Support Vector Machines (TSVMs) for text classifi­ cation. While regular Support Vector Ma­ chines (SVMs) try to induce a general deci­ sion function for a learning task, Transduc­ tive Support Vector Machines take into ac­ count a particular test set and try to mini­ mize misclassifications of just those particu­ lar examples. The paper presents an anal­ ysis of why TSVMs are well suited for text classification. These theoretical findings are supported by experiments on three test col­ lections. The experiments show substantial improvements over inductive methods, espe­ cially for small training sets, cutting the num­ ber of labeled training examples down to a twentieth on some tasks. This work also pro­ poses an algorithm for training TSVMs effi­ ciently, handling 10,000 examples and more.
| URL | BibTeX  
@inproceedings{joachims99,
title = {Transductive Inference for Text Classification using Support Vector Machines},
address = {Bled, SL},
author = {Thorsten Joachims},
booktitle = {Proceedings of {ICML}-99, 16th International Conference on Machine Learning},
editor = {Ivan Bratko and Saso Dzeroski},
pages = {200--209},
publisher = {Morgan Kaufmann Publishers, San Francisco, US},
url = {joachims99.ps},
year = {1999},
abstract = {This paper introduces Transductive Support Vector Machines (TSVMs) for text classifi­ cation. While regular Support Vector Ma­ chines (SVMs) try to induce a general deci­ sion function for a learning task, Transduc­ tive Support Vector Machines take into ac­ count a particular test set and try to mini­ mize misclassifications of just those particu­ lar examples. The paper presents an anal­ ysis of why TSVMs are well suited for text classification. These theoretical findings are supported by experiments on three test col­ lections. The experiments show substantial improvements over inductive methods, espe­ cially for small training sets, cutting the num­ ber of labeled training examples down to a twentieth on some tasks. This work also pro­ poses an algorithm for training TSVMs effi­ ciently, handling 10,000 examples and more.},
lastdatemodified = {2005-08-06}, lastname = {Joachims}, pdf = {joachims99.pdf}, own = {own}, read = {notread},
keywords = {eventually_useful studienarbeit }
}