Provided by: Australian Computer Society
Topic: Data Management
Date Added: Oct 2007
Mining high utility itemsets from a transaction database is to find itemsets that have utility above a user-specified threshold. This problem is an extension of frequent itemset mining, which discovers itemsets that occur frequently (i.e. with occurrence count larger than a user given value). The problem of finding high utility itemsets is challenging, because the anti-monotone property so useful for pruning the search space in conventional frequent itemset mining does not apply to it. In this paper, the authors propose a new algorithm called CTU-PRO that mines high utility itemsets by bottom up traversal of a Compressed Utility Pattern (CUP) tree.