Third IEEE International Conference on Data Mining (ICDM'03) Mining High Utility Itemsets Melbourne, Florida November 19-November 22 ISBN: 0-7695-1978-4
Traditional association rule mining algorithms only generate a large number of highly frequent rules, but these rules do not provide useful answers for what the high utility rules are. In this work, we develop a novel idea of top-K objective-directed data mining, which focuses on mining the top-K high utility closed patterns that directly support a given business objective. To association mining, we add the concept of utility to capture highly desirable statistical patterns and present a level-wise item-set mining algorithm. With both positive and negative utilities, the anti-monotone pruning strategy in Apriori algorithm no longer holds. In response, we develop a new pruning strategy based on utilities that allow pruning of low utility itemsets to be done by means of a weaker but anti-monotonic condition. Our experimental results show that our algorithm does not require a user specified minimum utility and hence is effective in practice.
Citation:
Raymond Chan, Qiang Yang, Yi-Dong Shen, "Mining High Utility Itemsets," icdm, pp.19, Third IEEE International Conference on Data Mining (ICDM'03), 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||