On compression-based text classification

  • Authors:
  • Yuval Marton;Ning Wu;Lisa Hellerstein

  • Affiliations:
  • Department of Linguistics, University of Maryland, College Park, MD;Department of Computer and Information Science, Polytechnic University, Brooklyn, NY;Department of Computer and Information Science, Polytechnic University, Brooklyn, NY

  • Venue:
  • ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Compression-based text classification methods are easy to apply, requiring virtually no preprocessing of the data. Most such methods are character-based, and thus have the potential to automatically capture non-word features of a document, such as punctuation, word-stems, and features spanning more than one word. However, compression-based classification methods have drawbacks (such as slow running time), and not all such methods are equally effective. We present the results of a number of experiments designed to evaluate the effectiveness and behavior of different compression-based text classification methods on English text. Among our experiments are some specifically designed to test whether the ability to capture non-word (including super-word) features causes character-based text compression methods to achieve more accurate classification.