Abstract
High utility itemset mining is a popular pattern mining task, which aims at revealing all sets of items that yield a high profit in a transaction database. Although this task is useful to understand customer behavior, an important limitation is that high utility itemsets do not provide information about the purchase quantities of items. Recently, some algorithms were designed to address this issue by finding quantitative high utility itemsets but they can have very long execution times due to the larger search space. This paper addresses this issue by proposing a novel efficient algorithm for high utility quantitative itemset mining, called FHUQI-Miner (Fast High Utility Quantitative Itemset Miner). It performs a depth-first search and adopts two novel search space reduction strategies, named Exact Q-items Co-occurrence Pruning Strategy (EQCPS) and Range Q-items Co-occurrence Pruning Strategy (RQCPS). Experimental results show that the proposed algorithm is much faster than the state-of-art HUQI-Miner algorithm on sparse datasets.
| Original language | English |
|---|---|
| Pages (from-to) | 6785-6809 |
| Number of pages | 25 |
| Journal | Applied Intelligence |
| Volume | 51 |
| Issue number | 10 |
| DOIs | |
| State | Published - Oct 2021 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature.
Keywords
- High utility pattern
- Market basket analysis
- Pattern mining
- quantitative pattern
- Quantities
ASJC Scopus subject areas
- Artificial Intelligence