Efficient algorithms for mining maximal high-utility itemsets

To overcome the limitation of high-utility itemset mining, a more compact, lossless and concise representation of high utility itemsets (HUIs) have been proposed, such as closed HUIs (CHUIs) or maximal HUIs (MHUIs). In this paper, we present algorithms to efficiently mine MHUIs from transactional databases. The proposed algorithms utilize the many pruning techniques to significantly reduce the search space and increase the performance of the MHUIs mining process.