Abstract
Recently, utility mining has widely been discussed in the field of data mining. It finds high utility itemsets by considering both profits and quantities of items in transactional data sets. However, most of the existing approaches are based on the principle of levelwise processing, as in the traditional two-phase utility mining algorithm to find a high utility itemsets. In this paper, we propose an efficient utility mining approach that adopts an indexing mechanism to speed up the execution and reduce the memory requirement in the mining process. The indexing mechanism can imitate the traditional projection algorithms to achieve the aim of projecting sub-databases for mining. In addition, a pruning strategy is also applied to reduce the number of unpromising itemsets in mining. Finally, the experimental results on synthetic data sets and on a real data set show the superior performance of the proposed approach.
Original language | English |
---|---|
Pages (from-to) | 85-107 |
Number of pages | 23 |
Journal | Knowledge and Information Systems |
Volume | 38 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2014 |
Keywords
- Data mining
- High transaction-weighted utilization itemsets
- High utility itemsets
- Indexing mechanism
- Utility mining