Text Categorization using the Semi-Supervised Fuzzy c-Means Algorithm

Text Categorization (TC) is the automated assignment of text documents to predefined categories based on document contents. For the past few years, TC has become very important essentially in the Information Retrieval area, where information needs have tremendously increased with the rapid growth of textual information sources such as the Internet. In this paper, we compare, for text categorization, two partially supervised (or semi-supervised) clustering algorithms: the "Semi-Supervised Agglomerative Hierarchical Clustering (ssAHC) algorithm [1] and the Semi-Supervised Fuzzy-c- Means (ssFCM) algorithm [2]. This (Semi-Supervised) learning paradigm falls somewhere between the fully supervised and the fully unsupervised learning schemes, in the sense that it exploits both class information contained in labeled data (training documents) and structure information possessed by unlabeled data (test documents) in order to produce better partitions for test documents. Our experiments, make use of the Reuters 21578 database of documents and consist of a binary classification for each of the ten most populous categories of the Reuters database. To convert the documents into vector form, we experiment with different numbers of features, which we select based on an information gain criterion. We verify experimentally that ssFCM both outperforms and takes less time than the Fuzzy -c- Means (FCM) algorithm. With a smaller number of features, ssFCM's performance is also superior to that of ssAHC's [3]. Finally ssFCM results in improved performance and faster execution time as more weight is given to trailing documents.