Improving text categorization bootstrapping via unsupervised learning

We propose a text categorization bootstrapping algorithm in which categories are described by relevant seed words. Our method introduces two unsupervised techniques to improve the initial categorization step of the bootstrapping scheme: (i) using latent semantic spaces to estimate the similarity among documents and words, and (ii) the Gaussian Mixture algorithm, which dierentiates relevant and non-relevant category information using statistics from unlabeled examples. In particular, this second step maps the similarity scores to class posterior probabilities and therefore reduces sensitivity to keyword-dependent variations in scores. The algorithm was evaluated on two Text Categorization tasks and obtained good performance using only the category names as initial seeds. In particular the performance of the proposed method proved to be equivalent to a pure supervised approach trained on 70-160 labeled documents per category.