An Effective Hash-Based Algorithm for Mining Association Rules

Abstract

Now a day the database is becoming large. The
Apriori algorithm is used to find frequent itemsets but in the
apriori algorithm there is requirement to scan the database
many times this is significant when we work with the small
database but we concern with large database so we will use hash
based technique which reduce the size of the candidate
generation. Here we have used H-bit array hashing algorithm
and N-hash algorithm to create new hashing algorithm which is
having advantages of both the algorithm. The generated
algorithm does not use the lengthy and complex process of
mapping items into the bucket by hashing algorithm. The
proposed algorithm is efficient and requires less space for hash
table and maps items into hash table without collision