Nowadays, the automated text classification has witnessed special importance due to the increasing availability of documents in digital form and ensuing need to organize them. Although this problem is in the Information Retrieval (IR) field, the dominant approach is based on machine learning techniques. Approaches based on classifier committees have shown a better performance than the others. In this research, in addition to study text classification techniques and classification committees, two ideas in this field are proposed.
The first idea, is proposed based on Bagging committees. According to this idea, first, a training set by one of clustering techniques automatically is divided into several clusters based on class similarity (or dissimilarity). So for documents of every cluster, a classifier is trained and put in the committee as a member. In this approach the members of committee are created by the same technique. In our experiments for this idea, Naïve Bayesian, Rocchio and SVM learning techniques are used.
In the second idea, the creation of two layered committee is discussed. Based on this idea, one committee can be created that its members are itself a committee. Members of subcommittees are creating based on the first idea. This idea is based on the fact that if Naïve Bayesian committee acts better than Naïve Bayesian classifier and so, a committee out of these committees will improve the performance of classification.
Evaluation of the first idea showed that the improvement in performance based on precision and recall in Naïve Bayesian committee is exceeded the other committees (respectively 12 and 5.1 percent). Evaluation of the second idea showed that the improvement in performance in the second type of committee (based on the second idea) is more than that in the first type of committee (based on the first idea). Most improvement of performance in the second type of committee is referred to the Rocchio’s committee (based on precision and recall 3.8 and 18.8 percent, respectively).