A New Algorithm Finding Frequent Itemsets Based on Minimum Separating into Buckets

In this paper, we point out two main shortcomings of a conventional hash algorithm used for finding frequent itemsets in data mining excavate routine Hash algorithm: 1) it is difficult to choose a suitable hash function; 2) it is easy to lead to a hash conflict. In order to overcome these shortcomings, a new algorithm which can separate into buckets and can suit dynamically the practical need of finding frequent itemsets is advanced, which has a reaction ability to any itemsets according to need and does not look for any hash function and does not lead to any hash conflict. At the same time, the directions for further improving and razing the efficiency of this new algorithm are given.