轻工学报2017，Vol.32Issue(5)：103-108,6.DOI:10.3969/j.issn.2096-1553.2017.5.014
一种基于Rymon枚举树的快速挖掘无关集算法
A fast algorithm for mining free sets based on Rymon setenumeration tree
摘要
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.关键词
数据挖掘/频繁项集/精简表示/δ无关集/Rymon枚举树/剪枝策略Key words
data mining/frequent itemsets/concise representation/δ free sets/Rymon setenumeration tree/pruning strategy分类
信息技术与安全科学引用本文复制引用
许普乐,纪允..一种基于Rymon枚举树的快速挖掘无关集算法[J].轻工学报,2017,32(5):103-108,6.基金项目
安徽高校自然科学研究重点项目(KJ2017A552) （KJ2017A552）
高校优秀青年人才支持计划重点项目(gxyqZD2016591) （gxyqZD2016591）
