Description: 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
To Search:
File list (Check if you may need any files):
AprioriMain.c
Download