A Fast Algorithm for Chinese Text Categorization Based on Key Tree
To solving Chinese text categorization, a fast algorithm is proposed. The basic idea of the algorithm is: first constructs a weighted value of keywords dictionary which is constructed in key tree, then using the Hash function and the principle of giving priority for long term matching to mapping the strings in documentations to the dictionary. After that, calculate the sum of weights of the keywords which has been matched successfully. Finally take the maximum for the result of the classification. The algorithm can avoid the difficulty of Chinese word segmentation and its influence on accuracy of result. Theoretical analysis and experimental results indicate that the accuracy and the time efficiency of the algorithm is higher, whose comprehensive performance reaches to the level of current major technology.
X. Liu et al., "A Fast Algorithm for Chinese Text Categorization Based on Key Tree", Applied Mechanics and Materials, Vols. 58-60, pp. 1106-1112, 2011