Abstract
Combining the results of classifiers has shown much promise in machine learning generally. However, published work on combining text categorizers suggests that, for this particular application, improvements in performance are hard to attain. Explorative research using a simple voting system is presented and discussed in the light of a probabilistic model that was originally developed for safety critical software. It was found that typical categorization approaches produce predictions which are too similar for combining them to be effective since they tend to fail on the same records. Further experiments using two less orthodox categorizers are also presented which suggest that combining text categorizers can be successful, provided the essential element of ‘difference’ is considered.
Original language | English |
---|---|
Pages (from-to) | 511-524 |
Number of pages | 14 |
Journal | Computer Journal |
Volume | 45 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2002 |