Efficient mining high average-utility itemsets with effective pruning strategies and novel list structure

Li, Gufeng; Shang, Tao; Zhang, Yinling

doi:10.1007/s10489-022-03722-x

Cited by 2 publications

(1 citation statement)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Likewise, in a pattern mining area, there are some fields, such as uncertain pattern mining [7], that obtain useful patterns from uncertain or incomplete databases. Because of its suitability for analyzing databases, many applications, such as high utility pattern mining [8], high average utility pattern mining [9], erasable pattern mining [10], and differential sensor pattern mining [11], have been studied. Among them, high utility pattern mining expresses the utilities of itemsets by considering not only the occurrence of items but also their quantities and profits.…”

Section: Introductionmentioning

confidence: 99%

Incremental Top-k High Utility Pattern Mining and Analyzing Over the Entire Accumulated Dynamic Database

Lee,

Kim,

Cho

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Top-k high utility pattern mining, which extracts the highest top-k patterns that the users want to find, has been actively studied. Most previous studies in this domain have focused on static databases, where data insertions do not occur. In the real world, however, various applications continuously generate new data, and existing top-k high utility pattern mining algorithms devised to process static databases cannot handle incremental databases. Although some methods can handle stream data, they have the limitation of processing a portion of the database rather than the entire accumulated database. In this paper, we suggest an efficient incremental mining method that discovers top-k high utility patterns from the entire accumulated database. The proposed approach utilizes a list structure that stores minimal utility information required for the mining process and does not generate candidate itemsets. The suggested algorithm processes the incremental data with a single database scan and restructures the list for efficient mining. Moreover, four efficient threshold raising techniques along with a restoring technique are utilized to calculate the optimal threshold value in an accumulated incremental environment. The results of the experiments on runtime, memory, and scalability show that the suggested method efficiently processes the entire incremental database.INDEX TERMS Data analysis, High utility pattern, Incremental dynamic database, Pattern analysis, Top-k.

show abstract