A weighted frequent itemsets Incremental Updating Algorithm base on hash table

The excavating and updating of maximum frequent itemsets are the important aspects of data mining. The importance of each data item is not completely the same, and the items are not evenly distributed. This article proposed an effective mining algorithm of weighted frequent itemsets, WHIUA (Weighted Hash Incremental Updating Algorithm), which is based on the hash table data structure, to deal with the problem that database and minimum support are both changed. Analysis and experiments show that this algorithm can effectively increases the excavating and updating efficiency of maximum frequent itemsets.