Mining Correlated High-Utility Itemsets Using the Bond Measure

被引:19
|
作者
Fournier-Viger, Philippe [1 ]
Lin, Jerry Chun-Wei [2 ]
Tai Dinh [3 ]
Hoai Bac Le [4 ]
机构
[1] Harbin Inst Technol, Shenzhen Grad Sch, Sch Nat Sci & Humanities, Shenzhen, Peoples R China
[2] Harbin Inst Technol, Shenzhen Grad Sch, Sch Comp Sci & Technol, Shenzhen, Peoples R China
[3] Ho Chi Minh City Ind & Trade Coll, Fac Informat Technol, Ho Chi Minh City, Vietnam
[4] Univ Sci, Fac Informat Technol, Ho Chi Minh City, Vietnam
来源
关键词
High-utility itemset mining; Correlation; Bond measure; Correlated high-utility itemsets;
D O I
10.1007/978-3-319-32034-2_5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Mining high-utility itemsets (HUIs) is the task of finding the sets of items that yield a high profit in customer transaction databases. An important limitation of traditional high-utility itemset mining is that only the utility measure is used for assessing the interestingness of patterns. This leads to finding many itemsets that have a high profit but contain items that are weakly correlated. To address this issue, this paper proposes to integrate the concept of correlation in high-utility itemset mining to find profitable itemsets that are highly correlated, using the bond measure. An efficient algorithm named FCHM (Fast Correlated high-utility itemset Miner) is proposed to efficiently discover correlated high-utility itemsets. Experimental results show that FCHM is highly-efficient and can prune a huge amount of weakly correlated HUIs.
引用
收藏
页码:53 / 65
页数:13
相关论文
共 50 条
  • [31] A survey on soft computing-based high-utility itemsets mining
    Rajiv Kumar
    Kuldeep Singh
    Soft Computing, 2022, 26 : 6347 - 6392
  • [32] A survey on soft computing-based high-utility itemsets mining
    Kumar, Rajiv
    Singh, Kuldeep
    SOFT COMPUTING, 2022, 26 (13) : 6347 - 6392
  • [33] Selective Database Projections Based Approach for Mining High-Utility Itemsets
    Bai, Anita
    Deshpande, Parag S.
    Dhabu, Meera
    IEEE ACCESS, 2018, 6 : 14389 - 14409
  • [34] More Efficient Algorithms for Mining High-Utility Itemsets with Multiple Minimum Utility Thresholds
    Gan, Wensheng
    Lin, Jerry Chun-Wei
    Fournier-Viger, Philippe
    Chao, Han-Chieh
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2016, PT I, 2016, 9827 : 71 - 87
  • [35] Mining Correlated High Utility Itemsets in One Phase
    Bay Vo
    Nguyen, Le, V
    Vu, Vinh V.
    Lam, Mi T. H.
    Duong, Thuy T. M.
    Manh, Ly T.
    Nguyen, Thuy T. T.
    Nguyen, Loan T. T.
    Hong, Tzung-Pei
    IEEE ACCESS, 2020, 8 : 90465 - 90477
  • [36] Mining Top-k Regular High-Utility Itemsets in Transactional Databases
    Kumari, P. Lalitha
    Sanjeevi, S. G.
    Rao, T. V. Madhusudhana
    INTERNATIONAL JOURNAL OF DATA WAREHOUSING AND MINING, 2019, 15 (01) : 58 - 79
  • [37] A Hybrid Method for High-Utility Itemsets Mining in Large High-Dimensional Data
    Yu, Guangzhu
    Shao, Shihuang
    Luo, Bin
    Zeng, Xianhui
    INTERNATIONAL JOURNAL OF DATA WAREHOUSING AND MINING, 2009, 5 (01) : 57 - 73
  • [38] An Efficient Approach for Mining High-Utility Itemsets from Multiple Abstraction Levels
    Nguyen, Trinh D. D.
    Nguyen, Loan T. T.
    Kozierkiewicz, Adrianna
    Thiet Pham
    Vo, Bay
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2021, 2021, 12672 : 92 - 103
  • [39] FHN: An efficient algorithm for mining high-utility itemsets with negative unit profits
    Lin, Jerry Chun-Wei
    Fournier-Viger, Philippe
    Gan, Wensheng
    KNOWLEDGE-BASED SYSTEMS, 2016, 111 : 283 - 298
  • [40] Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining
    Lin, Jerry Chun-Wei
    Wu, Tsu-Yang
    Fournier-Viger, Philippe
    Lin, Guo
    Zhan, Justin
    Voznak, Miroslav
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2016, 55 : 269 - 284