The Apriori algorithm uses a hash tree data structure to e?ciently count the sup
ID: 3710274 • Letter: T
Question
The Apriori algorithm uses a hash tree data structure to e?ciently count the support of candidate itemsets. Consider the hash tree for candidate 3itemsets shown in Figure:
1) Given a transaction that contains items{1,3,4,5,8}, which of the hash tree leaf nodes will be visited when ?nding the candidates of the transaction?
2) Use the visited leaf nodes in part (b) to determine the candidate itemsets that are contained in the transaction {1,3,4,5,8}. ?
Can you explain briefly please!
1,4,7 3,6,9 2,5,8 3,6,9 47258L 3,6,9 1,4,7 1.4,7 2,5,8) L11 6,9 2,5, L5 L6 L7 L8 L9 ?12 L1 145 178) 1,4,7 (168)246 (258) 278) (289) (346 (356 (367) (379) (689 (678) (568) 3,6,9 ?2 L3 L4 (127) 125 459) (457)(158 456) 458 789)Explanation / Answer
1. The leaf nodes visited are L1, L3, L5, L9, and L11.
2. The candidates contained in the transaction are {1, 4, 5}, {1, 5, 8}, and {4, 5, 8}.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.