Mistake-Driven Learning in Text Categorization

Abstract

Learning problems in the text processing domain often map the text to a space whose dimensions are the measured features of the text, e.g., its words. Three characteristic properties of this domain are (a) very high dimensionality, (b) both the learned concepts and the instances reside very sparsely in the feature space, and (c) a high variation in the number of active features in an instance. In this work we study three mistake-driven learning algorithms for a typical task of this nature -- text categorization. We argue that these algorithms -- which categorize documents by learning a linear separator in the feature space -- have a few properties that make them ideal for this domain. We then show that a quantum leap in performance is achieved when we further modify the algorithms to better address some of the specific characteristics of the domain. In particular, we demonstrate (1) how variation in document length can be tolerated by either normalizing feature weights or by using negative weights, (2) the positive effect of applying a threshold range in training, (3) alternatives in considering feature frequency, and (4) the benefits of discarding features while training. Overall, we present an algorithm, a variation of Littlestone's Winnow, which performs significantly better than any other algorithm tested on this task using a similar feature set.

9 pages, uses aclap.sty

References in corpus (1)

• Applying Winnow to Context-Sensitive Spelling Correction

Cited by in corpus (5)

• Machine Learning in Automated Text Categorization
• An evaluation of Naive Bayesian anti-spam filtering
• Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach
• A Winnow-Based Approach to Context-Sensitive Spelling Correction
• Efficient Path Prediction for Semi-Supervised and Weakly Supervised Hierarchical Text Classification