Mining high average-utility itemsets

Authors:
Tzung-Pei Hong;Cho-Han Lee;Shyue-Liang Wang
Affiliations:
Dept. of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan;Institute of Electrical Engineering, National University of Kaohsiung, Kaohsiung, Taiwan;Dept. of Information Management, National University of Kaohsiung, Kaohsiung, Taiwan
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 8
Cited 1

An effective hash-based algorithm for mining association rules

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A fast high utility itemsets mining algorithm

UBDM '05 Proceedings of the 1st international workshop on Utility-based data mining
Mining itemset utilities from transaction databases

Data & Knowledge Engineering - Special issue: ER 2003
Direct candidates generation: a novel algorithm for discovering complete share-frequent itemsets

FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
A two-phase algorithm for fast discovery of high utility itemsets

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining

Efficiently mining high average utility itemsets with a tree structure

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The average utility measure is adopted in this paper to reveal a better utility effect of combining several items than the original utility measure. A mining algorithm is then proposed to efficiently find the high average-utility itemsets. It uses the summation of the maximal utility among the items in each transaction including the target itemset as the upper bounds to overestimate the actual average utilities of the itemset and processes it in two phases. As expected, the mined high average-utility itemsets in the proposed way will be fewer than the high utility itemset under the same threshold. Experiments results also show the performance of the proposed algorithm.