UP-Growth: An efficient algorithm for high utility itemset mining

S. Tseng, Cheng Wei Wu, Bai En Shie, Philip S. Yu

研究成果: Conference contribution同行評審

282 引文 斯高帕斯(Scopus)

摘要

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. The 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.

原文English
主出版物標題KDD'10 - Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data
頁面253-262
頁數10
DOIs
出版狀態Published - 7 九月 2010
事件16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD-2010 - Washington, DC, United States
持續時間: 25 七月 201028 七月 2010

出版系列

名字Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Conference

Conference16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD-2010
國家/地區United States
城市Washington, DC
期間25/07/1028/07/10

指紋

深入研究「UP-Growth: An efficient algorithm for high utility itemset mining」主題。共同形成了獨特的指紋。

引用此