IPHM: Incremental periodic high-utility mining algorithm in dynamic and evolving data environments

Periodic high-utility itemset (PHUI) mining can extend beyond the conventional approach of high-utility itemset mining by uncovering recurring customer purchase behaviors common in real-life scenarios (e.g., buying apples and oranges every three days or weekly). Such behaviors, particularly in market basket databases, signify stable patterns that ensure long-term profitability. Existing PHUI mining algorithms assume a static database and incur significant costs when handling incremental databases, as each batch of new transactions necessitates reprocessing the entire dataset. To overcome this challenge, we introduce the Incremental Periodic High-Utility Itemset Miner (IPHM), a method for efficiently extracting periodic high-utility itemsets in incremental database environments. We propose an innovative incremental utility-list structure tailored for incremental database scenarios. Effective pruning strategies are employed to expedite the construction and update of incremental utility-lists and to discard unpromising candidates. As demonstrated by the experimental results, the algorithm is efficacious and efficient, highlighting its practical applicability in dynamic data environments. The algorithm shows a remarkable ability to quickly adapt to database changes, making it highly suitable for applications in market basket analysis where frequent updates are common.

Authors

Institutions

Publication Details

Journal
Heliyon
Published
2024-09-01
DOI
https://doi.org/10.1016/j.heliyon.2024.e37761
Citations
4
Primary Topic
Data Mining Algorithms and Applications
Type
article
Field-Weighted Citation Impact
3.12
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

IPHM: Incremental periodic high-utility mining algorithm in dynamic and evolving data environments

Huiwu Huang, Shixi Chen, Jiahui Chen
4 citations
Heliyon
Data Mining Algorithms and Applications
3.12
article

IPHM: Incremental periodic high-utility mining algorithm in dynamic and evolving data environments

Huiwu Huang, Shixi Chen, Jiahui Chen
article en
4 citations

Abstract

Periodic high-utility itemset (PHUI) mining can extend beyond the conventional approach of high-utility itemset mining by uncovering recurring customer purchase behaviors common in real-life scenarios (e.g., buying apples and oranges every three days or weekly). Such behaviors, particularly in market basket databases, signify stable patterns that ensure long-term profitability. Existing PHUI mining algorithms assume a static database and incur significant costs when handling incremental databases, as each batch of new transactions necessitates reprocessing the entire dataset. To overcome this challenge, we introduce the Incremental Periodic High-Utility Itemset Miner (IPHM), a method for efficiently extracting periodic high-utility itemsets in incremental database environments. We propose an innovative incremental utility-list structure tailored for incremental database scenarios. Effective pruning strategies are employed to expedite the construction and update of incremental utility-lists and to discard unpromising candidates. As demonstrated by the experimental results, the algorithm is efficacious and efficient, highlighting its practical applicability in dynamic data environments. The algorithm shows a remarkable ability to quickly adapt to database changes, making it highly suitable for applications in market basket analysis where frequent updates are common.

HeliyonVol. 10(18)
Guangdong University of Technology (CN)
Openalex Percentile: Top 7%
Data Mining Algorithms and Applications
3.12
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.