UP-Hist Tree
Authors:
Open Access
- 1 January 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 56-61
Abstract
High-utility itemset mining is an emerging research area in the field of Data Mining. Several algorithms were proposed to find high-utility itemsets from transaction databases and use a data structure called UP-tree for their working. However, algorithms based on UP-tree generate a lot of candidates due to limited information availability in UP-tree for computing utility value estimates of itemsets. In this paper, we present a data structure named UP-Hist tree which maintains a histogram of item quantities with each node of the tree. The histogram allows computation of better utility estimates for effective pruning of the search space. Extensive experiments on real as well as synthetic datasets show that our algorithm based on UP-Hist tree outperforms the state of the art pattern-growth based algorithms in terms of the total number of candidate high utility itemsets generated that needs to be verified.Keywords
This publication has 15 references indexed in Scilit:
- An Algorithm of Top-k High Utility Itemsets Mining over Data StreamJournal of Software, 2014
- FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning2014
- Efficiently Mining Top-K High Utility Sequential Patterns2013
- Mining high utility itemsets without candidate generation2012
- Mining High Utility Mobile Sequential Patterns in Mobile Commerce Environments2011
- UP-Growth2010
- CanTree: a canonical-order tree for incremental frequent-pattern miningKnowledge and Information Systems, 2006
- A fast high utility itemsets mining algorithm2005
- A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets2005
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000