2010 UPGrowthAnEfficientAlgorithmfor

From GM-RKB
Jump to navigation Jump to search

Subject Headings:

Notes

Cited By

Quotes

Author Keywords

Abstract

Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits. Although a number of relevant approaches 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 an efficient algorithm, namely UP-Growth (Utility Pattern Growth), for mining high utility itemsets with a set of techniques for pruning candidate itemsets. The information of high utility itemsets is maintained in a special data structure named UP-Tree (Utility Pattern Tree) such that the candidate itemsets can be generated efficiently with only two scans of the database. The performance of UP-Growth was evaluated in comparison with the state-of-the-art algorithms on different types of datasets. experimental results show that UP-Growth not only reduces the number of candidates effectively but also outperforms other algorithms substantially in terms of execution time, especially when the database contains lots of long transactions.

References

,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2010 UPGrowthAnEfficientAlgorithmforPhilip S. Yu
Vincent S. Tseng
Cheng-Wei Wu
Bai-En Shie
UP-Growth: An Efficient Algorithm for High Utility Itemset MiningKDD-2010 Proceedingshttp://making.csie.ndhu.edu.tw/seminar/making/papers/PPT/UP-Growth An Efficient Algorithm for High Utility Itemset Mining(SIGKDD2010).pptx10.1145/1835804.18358392010