Learning to Weight for Text Classification
This addresses the challenge of improving term weighting in text classification for IR and related tasks, though it is incremental as it builds on existing supervised weighting ideas.
The paper tackles the problem of inconsistent improvements in supervised term weighting for text classification by proposing a novel approach called Learning to Weight (LTW), which learns a term weighting function optimized on training data, and shows that it outperforms previous methods on several benchmarks.
In information retrieval (IR) and related tasks, term weighting approaches typically consider the frequency of the term in the document and in the collection in order to compute a score reflecting the importance of the term for the document. In tasks characterized by the presence of training data (such as text classification) it seems logical that the term weighting function should take into account the distribution (as estimated from training data) of the term across the classes of interest. Although `supervised term weighting' approaches that use this intuition have been described before, they have failed to show consistent improvements. In this article we analyse the possible reasons for this failure, and call consolidated assumptions into question. Following this criticism we propose a novel supervised term weighting approach that, instead of relying on any predefined formula, learns a term weighting function optimised on the training set of interest; we dub this approach \emph{Learning to Weight} (LTW). The experiments that we run on several well-known benchmarks, and using different learning methods, show that our method outperforms previous term weighting approaches in text classification.