Given a transaction that contains items {1, 3, 4, 5, 8}, which of the hash tree leaf nodes will be visited when finding the candidates of the trans- action?
The Apriori algorithm uses a hash tree data structure to efficiently count
the support of candidate itemsets. Consider the hash tree for candidate 3-
itemsets shown in Figure 6.2.
The leaf nodes visited are L1, L3, L5, L9, and L11.
Computer Science & Information Technology
You might also like to view...
Explain what a compound operator is, and what it consists of.
What will be an ideal response?
Computer Science & Information Technology
A(n) ________ is usually a live broadcast of audio and video content over the Internet.
Fill in the blank(s) with the appropriate word(s).
Computer Science & Information Technology