一种基于后缀树的简洁关联规则挖掘有效剪枝方法
An effective search space pruning method for concise associaiton rules mining based on suffix-tree
-
摘要: 针对基于闭模式简洁关联规则挖掘中搜索空间和计算量过大、挖掘有效性降低的问题,提出一种新的剪枝和挖掘方法.该方法通过充分利用挖掘数据结构,保留尽可能少的挖掘后缀信息,直接挖掘简洁项集并枚举简洁关联规则;不需要保留大量中间结构和重复扫描数据库,可在较小代价下完成对项集搜索空间进行剪枝.实验表明,相比传统方法本方法更加有效,并对各种数据集具有较好的可规模性.Abstract: For itemset search space is too huge which increases concise association rule based on closed itemset calculation and decreases mining efficiency,a new search space pruning method was proposed.It exploits suffix-tree like structure and just keeps as little as tail information.It can prune search space with little cost and mine concise itemsets and rules directly.Additionally,it avoids scanning original database recursively and achieves good performance.Experimental results show it is an effective method for concise association rule mining and has good scalibility.
-
Key words:
- association rule generator /
- data mining /
- effective search space pruning method /
- suffix-tree /
-
点击查看大图
计量
- PDF下载量: 37
- 文章访问数: 816
- 引证文献数: 0
下载:
