... 81,4,72,5,83,6,9Hash FunctionCandidate Hash TreeHash on 2, 5 or 8Data Mining Association Analysis: Basic Concepts and AlgorithmsLecture Notes for Chapter 6Introduction to Data MiningbyTan, ... each candidate itemset–To reduce the number of comparisons, store the candidates in a hash structure• Instead of matching each transaction against every candidate, match it against candidates ... increases–Used by DHP and vertical-based mining algorithmsReduce the number of comparisons (NM)–Use efficient data structures to store the candidates or transactions–No need to match every candidate...