An efficient PSO-based evolutionary model for closed high-utility itemset mining

被引:0
|
作者
Carstensen, Simen [1 ]
Lin, Jerry Chun-Wei [2 ]
机构
[1] Univ Bergen, Bergen, Norway
[2] Western Norway Univ Appl Sci, Bergen, Norway
关键词
Evolutionary computation; Closed high-utility itemset; Data mining; Optimization; Particle swarm optimization; DISCOVERY;
D O I
10.1007/s10489-024-06151-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
High-utility itemset mining (HUIM) is a widely adopted data mining technique for discovering valuable patterns in transactional databases. Although HUIM can provide useful knowledge in various types of data, it can be challenging to interpret the results when many patterns are found. To alleviate this, closed high-utility itemset mining (CHUIM) has been suggested, which provides users with a more concise and meaningful set of solutions. However, CHUIM is a computationally demanding task, and current approaches can require prolonged runtimes. This paper aims to solve this problem and proposes a meta-heuristic model based on particle swarm optimization (PSO) to discover CHUIs, called CHUI-PSO. Moreover, the algorithm incorporates several new strategies to reduce the computational cost associated with similar existing techniques. First, we introduce Extended TWU pruning (ETP), which aims to decrease the number of possible candidates to improve the discovery of solutions in large search spaces. Second, we propose two new utility upper bounds, used to estimate itemset utilities and bypass expensive candidate evaluations. Finally, to increase population diversity and prevent redundant computations, we suggest a structure called ExploredSet to maintain and utilize the evaluated candidates. Extensive experimental results show that CHUI-PSO outperforms the current state-of-the-art algorithms regarding execution time, accuracy, and convergence.
引用
收藏
页数:17
相关论文
共 50 条
  • [31] Improved Genetic Algorithm for High-Utility Itemset Mining
    Zhang, Qiang
    Fang, Wei
    Sun, Jun
    Wang, Quan
    IEEE ACCESS, 2019, 7 : 176799 - 176813
  • [32] SMIM Framework to Generalize High-Utility Itemset Mining
    Dawar, Siddharth
    Goyal, Vikram
    Bera, Debajyoti
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2021, PT II, 2022, 13088 : 3 - 15
  • [33] FCHUIM: Efficient Frequent and Closed High-Utility Itemsets Mining
    Wei, Tianyou
    Wang, Bin
    Zhang, Yuntian
    Hu, Keyong
    Yao, Yinfeng
    Liu, Hao
    IEEE ACCESS, 2020, 8 : 109928 - 109939
  • [34] An Efficient Method for Mining Closed Potential High-Utility Itemsets
    Vo, Bay
    Nguyen, Loan T. T.
    Bui, Nguyen
    Nguyen, Trinh D. D.
    Huynh, Van-Nam
    Hong, Tzung-Pei
    IEEE ACCESS, 2020, 8 (08): : 31813 - 31822
  • [35] Frequent Closed High-Utility Itemset Mining Algorithm Based on Leiden Community Detection and Compact Genetic Algorithm
    Zhao, Xiumei
    Zhong, Xincheng
    Han, Bing
    IEEE ACCESS, 2024, 12 : 84763 - 84773
  • [36] Efficient mining of closed high-utility itemsets in dynamic and incremental databases
    Vlashejerdi, Mahnaz Naderi
    Daneshpour, Negin
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2025, 144
  • [37] A BPSO-based method for high-utility itemset mining without minimum utility threshold
    Gunawan, Ridowati
    Winarko, Edi
    Pulungan, Reza
    KNOWLEDGE-BASED SYSTEMS, 2020, 190
  • [38] TopHUI: Top-k high-utility itemset mining with negative utility
    Gan, Wensheng
    Wan, Shicheng
    Chen, Jiahui
    Chen, Chien-Ming
    Qiu, Lina
    2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2020, : 5350 - 5359
  • [39] GPU-Based Efficient Parallel Heuristic Algorithm for High-Utility Itemset Mining in Large Transaction Datasets
    Fang, Wei
    Jiang, Haipeng
    Lu, Hengyang
    Sun, Jun
    Wu, Xiaojun
    Lin, Jerry Chun-Wei
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (02) : 652 - 667
  • [40] Whitebox Induction of Default Rules Using High-Utility Itemset Mining
    Shakerin, Farhad
    Gupta, Gopal
    PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES (PADL 2020), 2020, 12007 : 168 - 176