No abstract

Traditional association rule mining has been widely studied. But it is unsuitable for real‐world applications where factors such as unit profits of items and purchase quantities must be considered. High‐utility itemset mining (HUIM) is designed to find highly profitable patterns by considering both the purchase quantities and unit profits of items. However, most HUIM algorithms are designed to be applied to static databases. But in real‐world applications such as market basket analysis and business decision‐making, databases are often dynamically updated by inserting new data such as customer transactions. Several researchers have proposed algorithms to discover high‐utility itemsets (HUIs) in dynamically updated databases. Unlike batch algorithms, which always process a database from scratch, incremental high‐utility itemset mining (iHUIM) algorithms incrementally update and output HUIs, thus reducing the cost of discovering HUIs. This paper provides an up‐to‐date survey of the state‐of‐the‐art iHUIM algorithms, including Apriori‐based, tree‐based, and utility‐list‐based approaches. To the best of our knowledge, this is the first survey on the mining task of incremental high‐utility itemset mining. The paper also identifies several important issues and research challenges for iHUIM. WIREs Data Mining Knowl Discov 2018, 8:e1242. doi: 10.1002/widm.1242 This article is categorized under: Algorithmic Development > Association Rules Application Areas > Data Mining Software Tools Fundamental Concepts of Data and Knowledge > Knowledge Representation

No abstract