Word co-occurrence features for text classification

  • Authors:
  • Fábio Figueiredo;Leonardo Rocha;Thierson Couto;Thiago Salles;Marcos André Gonçalves;Wagner Meira Jr.

  • Affiliations:
  • EconoInfo Research, Belo Horizonte, Brazil and Universidade Federal de Minas Gerais, Computer Science Department, Belo Horizonte, Brazil;Universidade Federal de São João Del Rei, Computer Science Department, São João Del Rei, Brazil;Universidade Federal de Goiás, Institute of Informatics, Goiínia, Brazil;Universidade Federal de Minas Gerais, Computer Science Department, Belo Horizonte, Brazil;Universidade Federal de Minas Gerais, Computer Science Department, Belo Horizonte, Brazil;Universidade Federal de Minas Gerais, Computer Science Department, Belo Horizonte, Brazil

  • Venue:
  • Information Systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article we propose a data treatment strategy to generate new discriminative features, called compound-features (or c-features), for the sake of text classification. These c-features are composed by terms that co-occur in documents without any restrictions on order or distance between terms within a document. This strategy precedes the classification task, in order to enhance documents with discriminative c-features. The idea is that, when c-features are used in conjunction with single-features, the ambiguity and noise inherent to their bag-of-words representation are reduced. We use c-features composed of two terms in order to make their usage computationally feasible while improving the classifier effectiveness. We test this approach with several classification algorithms and single-label multi-class text collections. Experimental results demonstrated gains in almost all evaluated scenarios, from the simplest algorithms such as kNN (13% gain in micro-average F"1 in the 20 Newsgroups collection) to the most complex one, the state-of-the-art SVM (10% gain in macro-average F"1 in the collection OHSUMED).