一种基于模式树的频繁项集快速挖掘算法

模式树是目前频繁项集挖掘最常用的数据结构，使用模式树可以有效地将数据库压缩于内存，并在内存中完成对频繁项集的挖掘。为了进一步提高频繁项集挖掘算法的可扩展性，本文对模式树进行了细致的研究，在此基础上提出了一种挖掘频繁项集的新算法，FP-DFS算法。该算法通过对模式树的各种操作简化了对频繁项集的搜索过程。实验表明，该算法对于频繁项集挖掘具有比较高的效率。

A Fast algorithm for frequent item-set mining based on Pattern tree

Pattern tree is the most frequently used data structure in frequent item-set mining.By using pattern tree,database can be effectively compressed into main memory,and the subsequence mining task can be completed in main memory.To make further improvement on the scalability of the algorithm,we make a further study on the pattern tree ,and propose a new algorithm called FP-DFS based on the study.FP-DFS simplifies the mining processes through applying various operations on pattern tree. The experiments show that FP-DFS has good efficiency in frequent item-set mining.