一种基于Rymon枚举树的快速挖掘无关集算法
A fast algorithm for mining free sets based on Rymon setenumeration tree
-
摘要: 针对传统的挖掘算法在挖掘δ无关集时存在重复生成候选项集、遍历子项集等导致挖掘效率过低的问题，提出一个无关集判断定律，进而给出一种快速挖掘无关集算法FMFS.该算法利用Rymon枚举树作为搜索空间，结合一定的剪枝策略，再利用这个无关集判断定律对候选项集进行快速筛选.实验结果表明，该算法不仅能够挖掘出所有的无关集，且挖掘过程中的时间消耗优于目前已有算法.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.
-
Key words:
- data mining /
- frequent itemsets /
- concise representation /
- δ free sets /
- Rymon setenumeration tree /
- pruning strategy
-
-
[1]
纪允.析取闭合项集的快速生成和恢复算法研究[D].合肥:合肥工业大学,2013.
-
[2]
王红梅,党源源,胡明,等.基于排序树的频繁项集挖掘算法[J].吉林大学学报(工学版),2016,46(4):1216.
-
[3]
朱玉全,孙志挥,赵传申.快速更新频繁项集[J].计算机研究与发展,2003,40(1):94.
-
[4]
BASTIDE Y,TAOUIL R,PASQUIRE N,et al.Mining frequent patterns with counting inference[J].SIGKDD Explorations,2000,2(2):66.
-
[5]
许普乐,张勤,纪允.基于FP树的一种快速挖掘生成器算法[J].安庆师范学院学报(自然科学版),2013,19(1):48.
-
[6]
PASQUIER N,BASTIDE Y,TAOUIL R,et al.Discovering frequent closed itemsets for association rules[C]//7th Intl.Conf.on Database Theory.Heidelberg:Springer,1999:398.
-
[7]
BAYARDO R J.Efficiently mining long patterns from databases[C]//Proc of the ACM SIGMOD Int Conf on Management of Data.New York:ACM Press,1998:85.
-
[8]
MANNILA H,TOIVONEN H.Multiple uses of frequent sets and condensed representations:Extended abstract[C]//Proc of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96).[S.l.]:[s.n.],1996:189.
-
[9]
BOULICAUT J F,BYKOWSKI A,RIGOTTI C.Free-sets:A condensed representation of boolean data for the approximation of frequency queries[J].Data Mining and Knowledge Discovery,2003,7(1):5.
-
[10]
许普乐,纪允,张勤.应用FP树快速生成无关集算法[J].安庆师范学院学报(自然科学版),2016,22(2):60.
-
[11]
RYMON R.Search through systematic set enumeration[C]//Proc of Third Int'l Conf.on Principles of Knowledge Representation and Reasoning.[S.l.]:[s.n.],1992:539.
-
[12]
田卫东,纪允.一种频繁核心项集的快速挖掘算法[J].计算机工程,2014,40(6):120.
-
[1]
-
点击查看大图
计量
- PDF下载量: 66
- 文章访问数: 710
- 引证文献数: 0
下载:
