摘要
分析了Apriori算法关于发现频繁项目集的方法及其效率,提出了一种基于无向项集图的预处理策略,用于加快频繁项目集的生成过程.采用预处理策略的Apriori算法(UIGApriori算法)加快了频繁项目集的发现效率,改善了算法的性能.
In this article, by analyzing the way and the efficiency that Apriori algorithm discovers frequent itemsets, we propose a preprocessing idea which is based on undirected itemsets graph and aims at accelerating frequent itemsets discovery. Apriori algorithm adopting the preprocessing idea improves the efficiency of frequent itmsets discovery and the algorithm's performance.
出处
《山东师范大学学报(自然科学版)》
CAS
2005年第3期21-23,共3页
Journal of Shandong Normal University(Natural Science)
基金
山东省自然科学基金重大项目(Z2004G02)
关键词
关联规则挖掘
预处理策略
频繁项目集
association rules mining
preprocessing idea
frequent itemsets