Mining association rules from high utility itemsets

Abstract

    Most companies focus on their profit growth within the business environment. For example, supermarkets often analyze sales activities to investigate which products bring the most revenue. In order to solve the problem, we need to mine high utility item sets. Recently, there have been many researches focus on this problem. However, these methods consume more time and memory usage. In this paper, we propose an algorithm for saving the mining time and memory usage during mining process