Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases
Vincent S. M. Tseng, Bai-En Shie, Chengwei Wu et al. · IEEE Transactions on Knowledge and Data Engineering · 2012
Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits. Although a number of relevant algorithms have been proposed in recent years, they incur the problem of producing a large number of candidate itemsets for high utility itemsets. Such a large number of candidate itemsets degrades the mining performance in terms of execution time and space requirement. The situation may become worse when the database contains lots of long transactions or long high utility itemsets. In this paper, we propose two algorithms, namely utility pattern growth (UP-Growth) and UP-Growth+, for mining high utility itemsets with a set of effective strategies for pruning candidate itemsets. The information of high utility itemsets is maintained in a tree-based data structure named utility pattern tree (UP-Tree) such that candidate itemsets can be generated efficiently with only two scans of database. The performance of UP-Growth and UP-Growth+ is compared with the state-of-the-art algorithms on many types of both real and synthetic data sets. Experimental results show that the proposed algorithms, especially UP-Growth+, not only reduce the number of candidates effectively but also outperform other algorithms substantially in terms of runtime, especially when databases contain lots of long transactions.
Cited by 570 works. doi:10.1109/tkde.2012.59
Authors
References
- Fast algorithms for mining association rules
- Mining sequential patterns
- Mining frequent patterns without candidate generation
- Discovery of Multiple-Level Association Rules from Large Databases
- Mining frequent patterns without candidate generation
- Efficient mining of partial periodic patterns in time series database
- Scalable algorithms for association mining
- Mining sequential patterns by pattern-growth: the PrefixSpan approach
- Efficient data mining for path traversal patterns
- Mining association rules with weighted items