摘要
寻求最大频繁项集是关联规则挖掘的最重要步骤,通过研究Apriori算法的基本思想,利用Apriori性质对数据库中项集进行分解直接寻找最大频繁项集,避免扫描整个事务数据库而是有针对性的扫描部分数据,从而提高算法效率。
The most important step of mining association rule is to find the max frequent item. Through analyzing the basic thought of Apriori, it can directly find the max frequent item by decomposing the itemsets. This new arithmetic avoid scanning the whole database, so that it can improve the efficiency of algorithm.
出处
《计算机与数字工程》
2007年第9期37-39,共3页
Computer & Digital Engineering
