Transforming Chinese Document into Transaction Data Using Prefix-Hash-Tree
利用prefix—hash—tree实现从中文文本到事务数据的转换

The rapid growth in the amount of electronic documents brings both great opportunities and real challenges for automatic text classification. Among many existed approaches, association rule based document classification has aroused great attention as to its high accuracy and fast training time. In this paper, a special data structure called pre- fix-hash-tree is designed to efficiently transform unstructured Chinese text into structured transaction data. Experi- ments confirm that its relevant algorithms show high efficiency.