此算法实现了基本的Apriori算法,效率很低.

　　过程是:先通过对数据集进行扫描,得到候选1-项集C1,根据用户输入的最小支持度筛选出频繁1-项集L1,将筛选中

　　不满足条件的结果放入一个先验项集,然后对L1进行组合,并根据Apriori算法的先验原理,用每个组合的结果和先

　　验项集中的所有元素进行比较,如果组合结果的子集中包含先验集中的任何一个元组就将其排除,将没有被排除

　　的组合结果放入C2.如此循环反复,直到Cn或Ln为空.

　　2008.11.1-2008.11.3

-This algorithm is the basic Apriori algorithm, efficiency is very low. The process is: first, to scan through the data set obtained candidate 1- itemsets C1, based on user input selected minimum support frequent 1- itemset L1, will be screened does not meet the conditions in the prior entry into a set of results, then the combination of L1 and Apriori algorithm based on a priori principles, combined with the results of each item and set a priori to compare all the elements, if the combination results subset that contains any of the prior focus will be to exclude a tuple will not be excluded from the combined results into C2. so the cycle repeated until the Cn, or Ln is empty. 2008.11.1-2008.11.3