Support vector machines for text categorization
Published 1 January 2003
Avik Basu, Clarence P. Walters, Michael Shepherd
Citations146
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper compares artificial neural network and support vector machine algorithms for use as text classifiers of news items and identifies a reduction in feature set that provides improved results.
Abstract
Text categorization is the process of sorting text documents into one or more predefined categories or classes of similar documents. Differences in the results of such categorization arise from the feature set chosen to base the association of a given document with a given category. Advocates of text categorization recognize that the sorting of text documents into categories of like documents reduces the overhead required for fast retrieval of such documents and provides smaller domains in which the users may explore similar documents. In this paper we are interested in examining whether automatic classification of news texts can be improved by prefiltering the vocabulary to reduce the feature set used in the computations. First we compare artificial neural network and support vector machine algorithms for use as text classifiers of news items. Secondly, we identify a reduction in feature set that provides improved results.
Keywords
Computer Science
ACM Transactions on Intelligent Systems and TechnologyLIBSVM
41,340 Citations2011Chih-Chung Chang, Chih‐Jen Lin
Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
The Nature of Statistical Learning Theory
39,279 Citations1995Vladimir Vapnik
Data Mining and Knowledge DiscoveryA Tutorial on Support Vector Machines for Pattern Recognition
16,433 Citations1998Christopher J. C. Burges
There are several arguments which support the observed high accuracy of SVMs, which are reviewed and numerous examples and proofs of most of the key theorems are given.
Lecture notes in computer scienceText categorization with Support Vector Machines: Learning with many relevant features
7,925 Citations1998Thorsten Joachims
SVMs achieve substantial improvements over the currently best performing methods and behave robustly over a variety of di-erent learning tasks, eliminating the need for manual parameter tuning.
Practical Methods of Optimization
6,403 Citations2000R. Ian Fletcher
The MIT Press eBooksFast Training of Support Vector Machines Using Sequential Minimal Optimization
5,462 Citations1998John Platt
A comparison of event models for naive bayes text classification
3,224 Citations1998Andrew McCallum, Kamal Nigam
It is found that the multi-variate Bernoulli performs well with small vocabulary sizes, but that the multinomial performs usually performs even better at larger vocabulary sizes--providing on average a 27% reduction in error over the multi -variateBernoulli model at any vocabulary size.
A re-examination of text categorization methods
2,660 Citations1999Yiming Yang, Xin Liu
The results show that SVM, kNN and LLSF signi cantly outperform NNet and NB when the number of positive training instances per category are small, and that all the methods perform comparably when the categories are over 300 instances.
Information RetrievalAn Evaluation of Statistical Approaches to Text Categorization
1,946 Citations1999Yiming Yang
Analysis and empirical evidence suggest that the evaluation results on some versions of Reuters were significantly affected by the inclusion of a large portion of unlabelled documents, mading those results difficult to interpret and leading to considerable confusions in the literature.
Inductive learning algorithms and representations for text categorization
1,465 Citations1998Susan Dumais, John Platt +2 more
A comparison of the effectiveness of five different automatic learning algorithms for text categorization in terms of learning speed, realtime classification speed, and classification accuracy is compared.
Neural Information Processing SystemsTwo-Dimensional Linear Discriminant Analysis
639 Citations2004Jieping Ye, Ravi Janardan +1 more
2DLDA, a novel LDA algorithm, which stands for 2-Dimensional Linear Discriminant Analysis, overcomes the singularity problem implicitly, while achieving efficiency and the combination of 2DLDA and classical LDA, namely 2 DLDA+LDA, is studied.
International Conference on Machine LearningSimplified support vector decision rules
429 Citations1996Christopher J. C. Burges
The results show that the method can decrease the computational complexity of the decision rule by a factor of ten with no loss in generalization perfor mance making the SVM test speed com petitive with that of other methods.
Parallel Support Vector Machines: The Cascade SVM
407 Citations2004Hans Peter Graf, Eric Cosatto +3 more
An algorithm for support vector machines (SVM) that can be parallelized efficiently and scales to very large problems with hundreds of thousands of training vectors, which can be spread over multiple processors with minimal communication overhead and requires far less memory.
A scalability analysis of classifiers in text categorization
163 Citations2003Yiming Yang, Jian Zhang +1 more
This paper addresses the problem with respect to a set of popular algorithms in text categorization, including Support Vector Machines, k-nearest neighbor, ridge regression, linear least square fit and logistic regression, with a formal analysis of the computational complexity of each classification method.
DSpace@MIT (Massachusetts Institute of Technology)Improving Multiclass Text Classification with the Support Vector Machine
126 Citations2001Jason D. M. Rennie, Ryan Rifkin
A new indicator of binary performance is developed to show that the SVM’s lower multiclass error is a result of its improved binary performance and the surprising result that one-vs-all classification performs favorably compared to other approaches even though it has no error-correcting properties.
Automated Text Categorization Using Support Vector Machine.
125 Citations1998James T. Kwok
SVM adapts eeciently in dynamic environments that require frequent additions to the document collection, and allows easy incorporation of new documents into an existing trained system.
Recurrent neural network learning for text routing
34 Citations1999Stefan Wermter
It is shown how recurrent plausibility networks in multiple layers encode the sequential context of word sequences according to different given categories and hold a lot of potential for developing learning and robust newswire agents for the internet.