摘要
著名的Apriori算法是一种挖掘关联规则的算法,其核心是基于两阶段频集思想的递推算法。该算法的基本思想是:寻找到所有频集,这些项集出现的频繁度至少高于预先定义的最低支持度。由频集推衍出强关联规则,而强关联规则必须满足最低支持度和最低可信度。
The famous Apriori algorithm is an algorithm of mining association rules, its core is based on two phase frequency set idea of recursive algorithm. The basic idea of this algorithm is: finds all frequent itemsets, which appears frequently at least and a predefined minimum support. Then generates strong association rules by the frequency set, these rules must meet the minimum support and minimum confidence.
出处
《现代计算机》
2012年第24期20-22,共3页
Modern Computer