关键词: 关联规则 频繁项集 最大目标频繁项集 FP-树

Abstract:

At present, one of the problems which exist in FP-tree based maximal frequent item.set mining algorithms is that the FP-tree is too large, and it willcost a lot of time to traverse the tree, and many mined frequent item.sets are not interested by the users. The redundant frequent patterns affect the  mining efficiency. In this paper,we present a sorted, com- pressed and non-redundant target frequent pattern tree （abbreviated to STFP-tree）. The sizee of the STFP-tree is significantly reduced, and on the basis of the STFP-tree, we put forward a maximal target frequent itemset mining algorithm, which  can satisfies the users＇requirements and accelerates the speed to traverse the tree, so the mining efficiency is improved in the algorithm.

Key words: （association rule, frequent itemset, maximal target frequent itermset, FP-tree）