Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
350724 | Computers in Human Behavior | 2014 | 9 Pages |
•A graph of terms can be effectively used for text classification.•Such a graph is extracted from documents thanks to a LDA based methodology.•Proposed method achieves good performances on standard datasets.•The approach can discover solutions matching user information needs.
Supervised text classifiers need to learn from many labeled examples to achieve a high accuracy. However, in a real context, sufficient labeled examples are not always available because human labeling is enormously time-consuming. For this reason, there has been recent interest in methods that are capable of obtaining a high accuracy when the size of the training set is small.In this paper we introduce a new single label text classification method that performs better than baseline methods when the number of labeled examples is small. Differently from most of the existing methods that usually make use of a vector of features composed of weighted words, the proposed approach uses a structured vector of features, composed of weighted pairs of words.The proposed vector of features is automatically learned, given a set of documents, using a global method for term extraction based on the Latent Dirichlet Allocation implemented as the Probabilistic Topic Model. Experiments performed using a small percentage of the original training set (about 1%) confirmed our theories.