Answered step by step
Verified Expert Solution
Question
1 Approved Answer
The Apriori algorithm uses a hash tree data structure to effrciently count the support of candidate itemsets. Consider the hash tree for candidate 3-itemsets shown
The Apriori algorithm uses a hash tree data structure to effrciently count the support of candidate itemsets. Consider the hash tree for candidate 3-itemsets shown in Figure
(a) Given a transaction that contains items {1,3,4,5,8}, which of the hash tree leaf nodes will be visited when fi.nding the candidates of the transaction? (b) Use the visited leaf nodes in part (b) to determine the candidate itemsets that are contained in the transaction {1,3,4,5,8}.
1,4,7 1,4,7 3,6,9 1,4,7 3,6,9 2,5,8 1,4,7 3,6,9 2,5,8 (346) 356) (367) (678) 2,5,8 L11 L1 L5 L6 ?7 ?12 f145) (178 1,4,7 /2,5,8 (246 (258)1379(689) (278 (289) 3,6,9 ?2 ?3 ?4 (127 125 1459) (457) (158) (456) 458) (789)
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