A fast algorithm for mining free sets based on Rymon setenumeration tree
XU Pu-le
JI Yun
Abstract：In view that traditional mining δ free sets algorithm exist generating candidate itemsets,traversing all direct subsets,and so on leading to low efficiency,a free sets determine lemma and a fast mining free sets algorithm FMFS were proposed.FMFS used Rymon setenumeration tree as searching space and combined with pruning strategy,and then used the free sets determine lemma to quickly determine the candidate itemset.Experimental results showed FMFS algorithm not only mined all free sets,but also showed better performance than existed mining algorithm.
Keywords：data miningfrequent itemsetsconcise representationδ free setsRymon setenumeration treepruning strategy
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 103-108 )