A Fast Subspace Text Categorization Method Using Parallel Classifiers

In today's world, the number of electronic documents made available to us is increasing day by day. It is therefore important to look at methods which speed up document search and reduce classifier training times. The data available to us is frequently divided into several broad domains with many sub-category levels. Each of these domains of data constitutes a subspace which can be processed separately. In this paper, separate classifiers of the same type are trained on different subspaces and a test vector is assigned to a subspace using a fast novel method of subspace detection. This parallel classifier architecture was tested with a wide variety of basic classifiers and the performance compared with that of a single basic classifier on the full data space. It was observed that the improvement in subspace learning was accompanied by a very significant reduction in training times for all types of classifiers used.

@InProceedings{OW12, 
 	 author =  {Oakes, Michael Philip and Wermter, Stefan},  
 	 title = {A Fast Subspace Text Categorization Method Using Parallel Classifiers}, 
 	 booktitle = {Proceedings of the 13th International Conference on Computational Linguistics and Intelligent Text Processing (CICLing)},
 	 editors = {},
 	 number = {},
 	 volume = {},
 	 pages = {132--143},
 	 year = {2012},
 	 month = {Mar},
 	 publisher = {Springer},
 	 doi = {10.1007/978-3-642-28601-8_12}, 
 }