Abstract:

Mining high utility itemsets is becoming a hot research topic in data mining owing to its ability to reflect users’preferences and make up for the shortcoming of measuring itemsets only by support degree.To meet the needs of larger data size,a parallel algorithm,called Parallel High Utility Itemset Mine (PHUIMine ),for mining high utility itemsets is proposed.Firstly,a tree structure,called DHUItree, is introduced to capture the information of high utility itemsets. Meanwhile, the DHUItree construction method is described,and the dynamic pruning strategy of DHUItree is discussed.Then, the parallel algorithm is presented. Experimental results show that PHUIMine algorithm is efficient and has low storage cost.

Key words: data mining;high utility itemset;parallel algorithm;DHUI-tree