Build potential sets of k items from Lk-1 by using pairs of itemsets in Lk-1 such that each pair has the first k-2 items in common. Now the k-2 common items and the one remaining
Application of Data Mining Techniques For Diabetic DataSet
item from each of the two itemsets are combined to form a k-itemset. The set of such potentially frequent k itemsets is the candidate set CK. (For k=2, we build the potential frequent pairs by using the frequent itemset L1 appears with every