The Apriori algorithm C k : Candidate itemsets of size k L k : frequent itemsets of size k L 1 = {frequent 1-itemsets}; for (k = 2; L k !=  ; k++) C
{"Image DocumentName": "The Apriori algorithm L1 = {frequent 1-itemsets};", "Image ImageDescription": "Ck: Candidate itemsets of size k. Lk : frequent itemsets of size k. L1 = {frequent 1-itemsets}; for (k = 2; Lk !=\uf0c6; k++) Ck+1 = GenerateCandidates(Lk)\u200f for each transaction t in database do. increment count of candidates in Ck+1 that are contained in t. endfor. Lk+1 = candidates in Ck+1 with support \u2265min_sup. return \uf0c8k Lk;", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}