%0 Journal Article
%A DU Yuan
%A ZHANG Shiwei
%T Improved canonical-order tree algorithm based on restructure
%D 2019
%R 10.11772/j.issn.1001-9081.2018061328
%J Journal of Computer Applications
%P 441-445
%V 39
%N 2
%X In order to solve the problems such as too many nodes and low compressibility in the tree structure constructed by CANonical-order tree (CAN-tree) algorithm, an improved CAN-tree algorithm based on restructure was proposed. Firstly, a tree structure was constructed directly with canonical-order, which scans the database only once in the frequent itemset mining algorithm. Then, in order to get a tree structure with high compressibility, a pruning operation was used with support in desending order to restructure the tree. Finally, frequent itemsets were mined out for the reconstructed tree structure. The experimental results show that compared with original CAN-tree algorithm, the number of nodes constructed by the improved CAN-tree algorithm is reduced to less than 20%,and the execution efficiency is improved by 4 to 6 times. The proposed algorithm shortens the execution time of the frequent itemset mining algorithm and effectively compresses the tree structure in it.
%U http://www.joca.cn/EN/10.11772/j.issn.1001-9081.2018061328