Efficiently mining high average utility itemsets with a tree structure

  • Authors:
  • Chun-Wei Lin;Tzung-Pei Hong;Wen-Hsiang Lu

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan;Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan and Department of Computer Science and Engineering, National Sun Yat-sen University, ...;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

The average utility measure has recently been proposed to reveal a better utility effect of combining several items than the original utility measure. It is defined as the total utility of an itemset divided by its number of items within it. In this paper, a new mining approach with the aid of a tree structure is proposed to efficiently implement the concept. The high average utility pattern tree (HAUP tree) structure is first designed to help keep some related information and then the HAUP-growth algorithm is proposed to mine high average utility itemsets from the tree structure. Experimental results also show that the proposed approach has a better performance than the Apriori-like average utility mining.