Q. Given a frequent itemset L, If |L| = k, then there are (Solved)
1. 2k – 1 candidate association rules
2. 2k candidate association rules
3. 2k – 2 candidate association rules
4. 2k -2 candidate association rules
- c. 2k – 2 candidate association rules