• DocumentCode
    3703580
  • Title

    Mining high-utility itemsets with various discount strategies

  • Author

    Jerry Chun-Wei Lin;Wensheng Gan;Philippe Fournier-Viger;Tzung-Pei Hong;Vincent S. Tseng

  • Author_Institution
    School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, China
  • fYear
    2015
  • Firstpage
    1
  • Lastpage
    10
  • Abstract
    In recent years, mining high-utility itemsets (HUIs) has become as a key topic in data mining. However, most of the developed algorithms assume the unrealistic situations that unit profits of items remain unchanged over time. But in real-life situations, the profit of an item or itemset varies as a function of cost prices, sales prices and sales strategies. In this paper, a novel framework for mining HUIs with two algorithms under various Discount strategies (HUID) are introduced. HUID-tp is based on various discount strategies and a novel downward closure property to mine the complete set of HUIs. HUID-Miner is an algorithm relying on a compact data structure (Positive-and-Negative Utility-list, PNU-list) and new pruning strategies to efficiently discover HUIs without candidate generation, while considerably reducing the size of the search space. Furthermore, a strategy named Estimated Utility Co-occurrence Strategy which stores the relationships between 2-itemsets is also adopted in the proposed improvement HUID-EMiner algorithm to speed up computation. An extensive experimental study carried on several real-life datasets shows the performance of the proposed algorithms.
  • Keywords
    "Itemsets","Computer science","Association rules","Data structures","Algorithm design and analysis"
  • Publisher
    ieee
  • Conference_Titel
    Data Science and Advanced Analytics (DSAA), 2015. 36678 2015. IEEE International Conference on
  • Print_ISBN
    978-1-4673-8272-4
  • Type

    conf

  • DOI
    10.1109/DSAA.2015.7344861
  • Filename
    7344861