%0 Journal Article
%T Transforming Chinese Document into Transaction Data Using Prefix-Hash-Tree<br>利用prefix—hash—tree实现从中文文本到事务数据的转换
%A QIAN Tie-Yun
%A WANG Yuan-Zhen
%A FENG Xiao-Nian
%A Computer Science
%A <br>钱铁云
%A 王元珍
%A 冯小年
%J 计算机科学
%D 2005
%I 
%X 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.
%K Chinese text classification
%K Prefix-hash-tree
%K Transaction data<br>中文文本
%K hash
%K 事务
%K 自动文本分类
%K 电子文档
%K 分类方法
%K 文本转换
%K 数据结构
%K 实验证明
%K 重构算法
%K 准确率
%K 结构化
%K 特殊性
%K 结构相
%K 关联
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=A903A96D8B84EB65&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=94C357A881DFC066&sid=ED01F5AE50BE09C0&eid=954CE65414DD94CA&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=7