Abstract:

General frequent patterns mining algorithms usually produce large sets of frequent patterns, in which there are many nontarget patterns that users aren’t interested in. To exclude the nontarget patterns , users have to do the second mining. Although TFPgrowth can produce all maximum target frequent patterns , the second minning is still essential to getting the target frequent patterns from them. If we restrict the producing of the nontarget frequent patterns early in the mining process, it would improve the efficiency of the algorithm. Based on the TFPgrowth and the SFPgrowth, a target frequent patterns mining algorithm  named STFPgrowth is proposed in this paper，its efficiency can be promoted by sorting TFPtree, adopting different ways to build sub trees and sift target frequent patterns in different cases of tree nodes. STFPgrowth mines all the target frequent patterns which satisfy users’ requirements, and users need not do the second minning . The experiments show that STFPgrowth is more efficient than the TFPgrowth, and outperforms Apriori and Eclat obviously.

Key words: frequent pattern;target frequent pattern;maximum target frequent pattern;mining algorithm