.png){kind=icon}
Return
HEPM: High-efficiency pattern mining
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2023.111068.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Pattern mining (PM) is an important field of data mining and has gained considerable momentum recently, mainly owing to the massive growth of big data. PM often sets attentive objectives such as mining frequent or high utility patterns to obtain attractive patterns. High utility patterns address the defect of frequent patterns that cannot reveal the maximum profit. However, it neglects another vital factor, cost or investment. This paper proposes a new high-efficiency PM problem that considers both utility and investment. The problem aims to find patterns with the maximum profit-to-investment ratio. Our paper is devoted to studying high-efficiency itemsets in transaction databases. We first formulate the criteria for a high-efficiency PM problem. Subsequently, we propose a two-phase algorithm called HEPM and an improved one-phase algorithm called HEPMiner to discover high-efficiency patterns in a transaction database. We design a corresponding pruning strategy within HEPM to reduce the search space. In HEPMiner, we utilize a novel efficiency-list and an estimated efficiency co-occurrence structure in the pruning strategies to further improve the mining performance. Moreover, we derive the upper bounds of efficiency for both algorithms. The experimental results demonstrate the effectiveness and efficiency of our two algorithms.
Keywords:
Data mining
High-efficiency pattern
Pruning strategy
Upper bound
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave View more