ITHUIM: An efficient algorithm for mining inter-transaction high utility itemsets
- 1Faculty of Information Technology, Ho Chi Minh City University of Industry and Trade, Ho Chi Minh City, Vietnam.
- 2Faculty of Information Technology, Industrial University of Ho Chi Minh City, Ho Chi Minh City, Viet Nam.
- 3Faculty of Information Technology, HUTECH University, Ho Chi Minh City, Viet Nam.
Abstract
Data mining is an active and vital research field that has led to the development of numerous algorithms and solutions. One significant contribution of this field is the discovery of high utility itemsets (HUIs) in transactional databases, which provides managers with valuable insights for maximizing profit. However, existing work on HUI mining has focused exclusively on the relationship among items within individual transactions, while ignoring relationships that occur across consecutive transactions. To address this limitation, we extend high utility itemset mining by considering mega-transaction relationships. We introduce the concept of mega-transaction and provide related definitions, formally defining the problem of mining inter-transaction high utility itemsets (ITHUIs). Furthermore, we develop and prove several mathematical properties that form the theoretical foundation for practical ITHUI mining. Based on these properties, a candidate pruning technique exploiting extended items is proposed to reduce the search space. Finally, we design a novel mining algorithm for efficiently discovering ITHUIs, named ITHUIM (ITHUI Miner).
Related
- Concordance between the fast and efficient mixed-effects algorithm (FEMA) and conventional mixed-effects modeling for whole-brain connectivity in longitudinal chronic pain
- GCOM-C/SGLI ground-area-based chlorophyll content estimation: a computationally efficient algorithm free from LAI and vegetation classification
- Rationally Selected Utility – A New Theory of Riskless Choice
- From Monogenic Variants to Polygenic Risk Scores in Inherited Cardiomyopathies: Clinical Utility, Ancestry Gaps, and Future Implementation in Arab Populations
- Batch Effect Correction to Enhance Utility of a Publicly Available ALS Proteomics Dataset
BibTeX
@article{vu2026ithuim,
title = {{ITHUIM: An efficient algorithm for mining inter-transaction high utility itemsets}},
author = {Vinh V Vu and Thiet T Pham and Bay Vo},
journal = {PLOS One},
year = {2026},
month = oct,
doi = {10.1371/journal.pone.0361061},
url = {https://doi.org/10.1371/journal.pone.0361061},
note = {CC BY},
}
RIS
TY - JOUR
TI - ITHUIM: An efficient algorithm for mining inter-transaction high utility itemsets
AU - Vinh V Vu
AU - Thiet T Pham
AU - Bay Vo
PY - 2026
DA - 2026/10/30
JO - PLOS One
DO - 10.1371/journal.pone.0361061
UR - https://doi.org/10.1371/journal.pone.0361061
AB - Data mining is an active and vital research field that has led to the development of numerous algorithms and solutions. One significant contribution of this field is the discovery of high utility itemsets (HUIs) in transactional databases, which provides managers with valuable insights for maximizing profit. However, existing work on HUI mining has focused exclusively on the relationship among items within individual transactions, while ignoring relationships that occur across consecutive transactions. To address this limitation, we extend high utility itemset mining by considering mega-transaction relationships. We introduce the concept of mega-transaction and provide related definitions, formally defining the problem of mining inter-transaction high utility itemsets (ITHUIs). Furthermore, we develop and prove several mathematical properties that form the theoretical foundation for practical ITHUI mining. Based on these properties, a candidate pruning technique exploiting extended items is proposed to reduce the search space. Finally, we design a novel mining algorithm for efficiently discovering ITHUIs, named ITHUIM (ITHUI Miner).
SN - 1932-6203
ER -