Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Q3. This question is about the PCY algorithm for counting frequent pairs of items. Suppose we have six items numbered 1, 2, 3, 4, 5,
Q3. This question is about the PCY algorithm for counting frequent pairs of items. Suppose we have six items numbered 1, 2, 3, 4, 5, 6. Consider the following twelve baskets. 1. {1,2,3} 2. {2,3,4} 3. {3,4,5) 4. {4,5,6} 5. {1,3,5} 6. {2,4,6} 7. {1,3,4} 8. {2,4,5) 9. {3,5,6} 10. {1,2,4} 11. {2,3,5} 12. {3,4,6} Suppose the support threshold is 4. On the first pass of the PCY algorithm, we use a hash table with 11 buckets, and the set {i,j} is hashed to ix j mod 11. a) By any method, compute the support for each item and each pair of items. (5 points) b) Which pairs hash to which buckets? (5 points) c) Which buckets are frequent? (3 points) d) Which pairs are counted on the second pass of the PCY algorithm? (2 points)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started