PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Nardiello P., Sebastiani F., Sperduti A. Discretizing continuous attributes in AdaBoost for text categorization. In: Ercim News, vol. 52 pp. 57 - 57. Ercim, 2003.
 
 
Abstract
(English)
We focus on two recently proposed algorithms in the family of "boosting"-based learners for automated text classification, AdaBoost.MH and AdaBoost.MH(KR). While the former is a realization of the well-known AdaBoost algorithm specifically aimed at multi-label text categorization, the latter is a generalization of the former based on the idea of learning a committee of classifier sub-committees. Both algorithms have been among the best performers in text categorization experiments so far. A problem in the use of both algorithms is that they require documents to be represented by binary vectors, indicating presence or absence of the terms in the document. As a consequence, these algorithms cannot take full advantage of the "weighted" representations (consisting of vectors of continuous attributes) that are customary in information retrieval tasks, and that provide a much more significant rendition of the document's content than binary representations. In this paper we address the problem of exploiting the potential of weighted representations in the context of AdaBoost-like algorithms by discretizing the continuous attributes through the application of entropy-based discretization methods. We present experimental results on the Reuters-21578 text categorization collection, showing that for both algorithms the version with discretized continuous attributes outperforms the version with traditional binary representations.
Subject Text categorization
I.5.2 Classifier Design and Evaluation
I.2.6 Learning
H.3.3 Information Search and Retrieval


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional