Generalized maximal utility for mining high average-utility itemsets

被引:21
|
作者
Song, Wei [1 ,2 ]
Liu, Lu [1 ]
Huang, Chaomin [1 ]
机构
[1] North China Univ Technol, Sch Informat Sci & Technol, Beijing 100144, Peoples R China
[2] Beijing Key Lab Integrat & Anal Large Scale Strea, Beijing 100144, Peoples R China
基金
中国国家自然科学基金;
关键词
Data mining; High average-utility itemset; Generalized maximal utility; Generalized average-utility upper bound; Critical support count; EFFICIENT ALGORITHM; PATTERNS; WINDOW;
D O I
10.1007/s10115-021-01614-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Mining high average-utility itemsets (HAUIs) is a promising research topic in data mining because, in contrast to high utility itemsets, they are not biased toward long itemsets. Regardless of what upper bounds and pruning strategies are used, most existing HAUI mining algorithms are founded on the concept of maximal utility, namely the highest utility of a single item in each transaction. In this paper, we study this problem by generalizing the typical maximal utility and average-utility upper bound from a single item to an itemset, and propose an efficient HAIU mining algorithm based on generalized maximal utility (HAUIM-GMU). For this algorithm, we first propose the concepts of generalized maximal utility and the generalized average-utility upper bound, and discuss how the proposed upper bound can be made tighter to generate fewer candidates. A new pruning strategy is then proposed based on the concept of support, and this is shown to be effective for filtering out unpromising itemsets. The final algorithm is described in detail. Extensive experimental results show that the HAUIM-GMU algorithm outperforms existing state-of-the-art algorithms.
引用
收藏
页码:2947 / 2967
页数:21
相关论文
共 50 条
  • [1] Generalized maximal utility for mining high average-utility itemsets
    Wei Song
    Lu Liu
    Chaomin Huang
    [J]. Knowledge and Information Systems, 2021, 63 : 2947 - 2967
  • [2] Mining High Average-Utility Itemsets
    Hong, Tzung-Pei
    Lee, Cho-Han
    Wang, Shyue-Liang
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, : 2526 - +
  • [3] High average-utility itemsets mining: a survey
    Kuldeep Singh
    Rajiv Kumar
    Bhaskar Biswas
    [J]. Applied Intelligence, 2022, 52 : 3901 - 3938
  • [4] High average-utility itemsets mining: a survey
    Singh, Kuldeep
    Kumar, Rajiv
    Biswas, Bhaskar
    [J]. APPLIED INTELLIGENCE, 2022, 52 (04) : 3901 - 3938
  • [5] A fast algorithm for mining high average-utility itemsets
    Jerry Chun-Wei Lin
    Shifeng Ren
    Philippe Fournier-Viger
    Tzung-Pei Hong
    Ja-Hwung Su
    Bay Vo
    [J]. Applied Intelligence, 2017, 47 : 331 - 346
  • [6] An Incremental Mining Algorithm for High Average-Utility Itemsets
    Hong, Tzung-Pei
    Lee, Cho-Han
    Wang, Shyue-Liang
    [J]. 2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009), 2009, : 421 - +
  • [7] A fast algorithm for mining high average-utility itemsets
    Lin, Jerry Chun-Wei
    Ren, Shifeng
    Fournier-Viger, Philippe
    Hong, Tzung-Pei
    Su, Ja-Hwung
    Vo, Bay
    [J]. APPLIED INTELLIGENCE, 2017, 47 (02) : 331 - 346
  • [8] Efficient Mining of High Average-Utility Itemsets with Multiple Thresholds
    Wu, Tsu-Yang
    Lin, Jerry Chun-Wei
    Ren, Shifeng
    [J]. ADVANCES IN INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, PT I, 2018, 81 : 198 - 205
  • [9] FIMHAUI: Fast Incremental Mining of High Average-Utility Itemsets
    Yildirim, Irfan
    Celik, Mete
    [J]. 2018 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND DATA PROCESSING (IDAP), 2018,
  • [10] Efficient Mining of High Average-Utility Itemsets with Multiple Minimum Thresholds
    Lin, Jerry Chun-Wei
    Li, Ting
    Fournier-Viger, Philippe
    Hong, Tzung-Pei
    Su, Ja-Hwung
    [J]. ADVANCES IN DATA MINING: APPLICATIONS AND THEORETICAL ASPECTS, 2016, 9728 : 14 - 28