摘要
Apriori算法是挖掘关联规则的一个经典算法,通过分析、研究该算法的基本思想,并利用项集的有序特性对其进行改进,减少了生成的候选集数量,从而提高算法的效率.
The Apriori algorithm is a classical algorithm for mining association rules.In this paper,we deeply study the idea of the Apriori algorithm,and present an improved algorithm by reordering itemsets,called ImpApri.The number of candidate itemsets can be largely reduced,and its efficiency is higher than that of the original Apriori algorithm.
出处
《广西师范大学学报(自然科学版)》
CAS
2004年第1期33-37,共5页
Journal of Guangxi Normal University:Natural Science Edition
基金
澳大利亚国家大型项目(ARC:DP0343109)