Incrementally updating the high average-utility patterns with pre-large concept

Abstract

High-utility itemset mining (HUIM) is considered as an emerging approach to detect the high-utility patterns from databases. Most existing algorithms of HUIM only consider the itemset utility regardless of the length. This limitation raises the utility as a result of a growing itemset size. High average-utility itemset mining (HAUIM) considers the size of the itemset, thus providing a more balanced scale to measure the average-utility for decision-making. Several algorithms were presented to efficiently mine the set of high average-utility itemsets (HAUIs) but most of them focus on handling static databases. In the past, a fast-updated (FUP)-based algorithm was developed to efficiently handle the incremental problem but it still has to re-scan the database when the itemset in the original database is small but there is a high average-utility upper-bound itemset (HAUUBI) in the newly inserted transactions. In this paper, an efficient framework called PRE-HAUIMI for transaction insertion in dynamic databases is developed, which relies on the average-utility-list (AUL) structures. Moreover, we apply the pre-large concept on HAUIM. A pre-large concept is used to speed up the mining performance, which can ensure that if the total utility in the newly inserted transaction is within the safety bound, the small itemsets in the original database could not be the large ones after the database is updated. This, in turn, reduces the recurring database scans and obtains the correct HAUIs. Experiments demonstrate that the PRE-HAUIMI outperforms the state-of-the-art batch mode HAUI-Miner, and the state-of-the-art incremental IHAUPM and FUP-based algorithms in terms of runtime, memory, number of assessed patterns and scalability.

Real‐time classification on oral ulcer images with residual network and image enhancement

“…It is difficult to get large datasets to train the proposed network. Therefore, image pre‐processing and enhancement techniques play an important role [31] in processing the oral images that we already have. Pre‐processing is used to remove different types of noise in oral images.…”

MCoR-Miner: Maximal Co-Occurrence Nonoverlapping Sequential Rule Mining

“…To reduce the number of patterns, top-k SPM [12], closed SPM [40], and maximal SPM [41] were developed, all of which require that the data are static rather than dynamic. To overcome this drawback, incremental SPM [42] and window SPM [43] methods were explored. However, the research community noticed that rare patterns were of great significance in the field, and rare pattern mining was also proposed [44].…”

An Incremental Interesting Maximal Frequent Itemset Mining Based on FP‐Growth Algorithm

“…Other algorithms used list structure on a dynamic database to mine erasable patterns and high-utility patterns such as IWEL [42], LINE [43], IMSEM [44], VME [45], PRE-HAUIMI [46], and HUI-list-INS [47] algorithms. Some other algorithms were based on the Apriori or tree method [48].…”