Mining High Average-Utility Itemsets

被引：44

作者：

Hong, Tzung-Pei ^{[1
]}

Lee, Cho-Han ^{[2
]}

Wang, Shyue-Liang ^{[3
]}

机构：

[1] Natl Kaohsiung Univ Appl Sci, Dept Comp Sci & Informat Engn, Kaohsiung 807, Taiwan

[2] Natl Kaohsiung Univ Appl Sci, Inst Elect Engn, Kaohsiung 807, Taiwan

[3] Natl Kaohsiung Univ Appl Sci, Dept Informat Management, Kaohsiung 807, Taiwan

来源：

2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9 | 2009年

关键词：

utility mining; average utility; two-phase mining; downward closure;

D O I：

10.1109/ICSMC.2009.5346333

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：2526 / +

页数：3