Improving linear classifier for Chinese text categorization

The goal of this paper is to derive extra representatives from each class to compensate for the potential weakness of linear classifiers that compute one representative for each class. To evaluate the effectiveness of our approach, we compared with linear classifier produced by Rocchio algorithm and the k-nearest neighbor (kNN) classifier. Experimental results show that our approach improved linear classifier and achieved micro-averaged accuracy close to that of kNN, with much less classification time. Furthermore, we could provide a suggestion to reorganize the structure of classes when identify new representatives for linear classifier.