Frequent Pattern Mining Using Double Hash Technique |
Author(s): |
| Priyanka D. Mali , L.J. Institute of Engineering and Technology; Shruti B. Yagnik, L.J. Institute of Engineering and Technology |
Keywords: |
| Apriori, Hash, Frequent pattern mining, Double hash technique, Support |
Abstract |
|
The core concept of data mining is finding frequent pattern and generate association rule based on support and confidence. There are many techniques for mining frequent patterns like apriori, FP growth algorithm, ECLAT, sampling algorithm, partitioning algorithm, H-mine algorithm, direct hash algorithm (DHA) which use hashing technique and double hash technique to find frequent itemset and store data in array structure. Limitation of hashing technique is that hash collision occurs. Direct hash generates primary clusters. To avoid collision open addressing is used. Quadratic probing generates secondary clustering. Both primary and secondary clustering is removed by double hash technique. In this paper method is suggested to improve insertion, deletion and searching in double hash table. |
Other Details |
|
Paper ID: IJSRDV3I40904 Published in: Volume : 3, Issue : 4 Publication Date: 01/07/2015 Page(s): 1758-1761 |
Article Preview |
|
|
|
|
