An advanced approach for incremental flexible periodic pattern mining on time-series data

Kim, Hyeonmo; Kim, Heonho; Kim, Sinyoung; Kim, Hanju; Cho, M. Y.; Vo, Bay; Lin, Jerry Chun‐Wei; Yun, Unil

doi:10.1016/j.eswa.2023.120697

Cited by 4 publications

(1 citation statement)

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In such situations, realtime inserted incremental data must be scanned once. While various pattern mining algorithms [13], [14] have been proposed to process incremental databases, no incremental method for top-k high utility pattern mining has been studied, where the entire accumulated database is efficiently processed with one scan. Motivated by this, we propose an efficient Incremental Top-k High Utility Itemset mining algorithm (ITHUI) to discover top-k high utility patterns from accumulated incremental databases with a single scan using a list structure.…”

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

Section: Introductionmentioning

confidence: 99%