In Apriori algorithm, if 1 item-sets are 100, then the number of candidate 2 item-sets are

The correct answer is C. 4950.

The Apriori algorithm is a frequent itemset mining algorithm that finds all frequent item sets in a database. It works by first finding all the 1-itemsets, then finding all the 2-itemsets that are frequent, and so on.

The number of candidate 2-itemsets is equal to the number of combinations of 2 items from the set of 100 items, which is $100 \choose 2 = 4950$.

Option

448 288 448 288 448s170.8 0 213.4-11.5c23.5-6.3 42-24.2 48.3-47.8 11.4-42.9 11.4-132.3 11.4-132.3s0-89.4-11.4-132.3zm-317.5 213.5V175.2l142.7 81.2-142.7 81.2z"/> Subscribe on YouTube