... 81,4,72,5,83,6,9Hash FunctionCandidate Hash TreeHash on 2, 5 or 8 Data Mining Association Analysis: Basic Concepts and AlgorithmsLecture Notes for Chapter 6Introduction to Data Mining byTan, Steinbach, ... 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 ... DB•Eliminate candidates that are infrequent, leaving only those that are frequent© Tan,Steinbach, Kumar Introduction to Data Mining 16 Reducing Number of ComparisonsCandidate counting:–Scan the database...