The Community for Technology Leaders
Green Image
Issue No. 08 - Aug. (2013 vol. 25)
ISSN: 1041-4347
pp: 1772-1786
Vincent S. Tseng , National Cheng Kung University, Tainan City
Bai-En Shie , National Cheng Kung University, Tainan City
Cheng-Wei Wu , National Cheng Kung University, Tainan City
Philip S. Yu , University of Illnois at Chicago, Chicago and King Abdulaziz University, Jeddah
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.
Itemsets, Algorithm design and analysis, Association rules, Data structures, data mining, Candidate pruning, frequent itemset, high utility itemset, utility mining

V. S. Tseng, B. Shie, C. Wu and P. S. Yu, "Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 25, no. , pp. 1772-1786, 2013.
84 ms
(Ver 3.3 (11022016))