AN EFFICIENT ALGORITHM FOR MINING CLOSED HIGH UTILITY ITEMSET

Mining of High utility itemsets refers to discovering sets of data items that have high utilities. In recent years the high utility itemsets mining has extensive attentions due to the wide applications in various domains like biomedicine and commerce. Extraction of high utility itemsets from database is very problematic task. The formulated high utility itemset degrades the efficiency of the mining process. The existing algorithms suffer the problem of producing a large amount of candidates, which degrades the mining performance in terms of time and space. The Closed high utility itemset proposed to achieve this goal. In this paper, a novel algorithm has been proposed to discover the high utility itemset without candidates generation. Experimental results show that the proposed algorithm is faster than the state-of-the-art algorithms.