Efficient Chain Structure for High-Utility Sequential Pattern Mining

被引:21
|
作者
Lin, Jerry Chun-Wei [1 ]
Li, Yuanfa [2 ]
Fournier-Viger, Philippe [3 ]
Djenouri, Youcef [4 ]
Zhang, Ji [5 ]
机构
[1] Western Norway Univ Appl Sci, Dept Comp Sci Elect Engn & Math Sci, N-5063 Bergen, Norway
[2] Harbin Inst Technol Shenzhen, Sch Comp Sci & Technol, Shenzhen 518055, Peoples R China
[3] Harbin Inst Technol Shenzhen, Sch Humanities & Social Sci, Shenzhen 518055, Peoples R China
[4] SINTEF Digital, N-0373 Oslo, Norway
[5] Univ Southern Queensland, Fac Hlth Engn & Sci, Toowoomba, Qld 4350, Australia
关键词
Data mining; Itemsets; Upper bound; Heuristic algorithms; STEM; Computer science; High utility sequential pattern mining; sequence; SU-Chain structure; data mining; DISCOVERY; ALGORITHM; ITEMSETS;
D O I
10.1109/ACCESS.2020.2976662
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
High-utility sequential pattern mining (HUSPM) is an emerging topic in data mining, which considers both utility and sequence factors to derive the set of high-utility sequential patterns (HUSPs) from the quantitative databases. Several works have been presented to reduce the computational cost by variants of pruning strategies. In this paper, we present an efficient sequence-utility (SU)-chain structure, which can be used to store more relevant information to improve mining performance. Based on the SU-Chain structure, the existing pruning strategies can also be utilized here to early prune the unpromising candidates and obtain the satisfied HUSPs. Experiments are then compared with the state-of-the-art HUSPM algorithms and the results showed that the SU-Chain-based model can efficiently improve the efficiency performance than the existing HUSPM algorithms in terms of runtime and number of the determined candidates.
引用
收藏
页码:40714 / 40722
页数:9
相关论文
共 50 条
  • [41] High-utility and diverse itemset mining
    Amit Verma
    Siddharth Dawar
    Raman Kumar
    Shamkant Navathe
    Vikram Goyal
    Applied Intelligence, 2021, 51 : 4649 - 4663
  • [42] Mining Minimal High-Utility Itemsets
    Fournier-Viger, Philippe
    Lin, Jerry Chun-Wei
    Wu, Cheng-Wei
    Tseng, Vincent S.
    Faghihi, Usef
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2016, PT I, 2016, 9827 : 88 - 101
  • [43] Efficient evolutionary computation model of closed high-utility itemset mining
    Lin, Jerry Chun-Wei
    Djenouri, Youcef
    Srivastava, Gautam
    Fourier-Viger, Philippe
    APPLIED INTELLIGENCE, 2022, 52 (09) : 10604 - 10616
  • [44] 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
  • [45] FHN: Efficient Mining of High-Utility Itemsets with Negative Unit Profits
    Fournier-Viger, Philippe
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2014, 2014, 8933 : 16 - 29
  • [46] HUITWU: An Efficient Algorithm for High-Utility Itemset Mining in Transaction Databases
    Guo, Shi-Ming
    Gao, Hong
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2016, 31 (04) : 776 - 786
  • [47] HUITWU: An Efficient Algorithm for High-Utility Itemset Mining in Transaction Databases
    Shi-Ming Guo
    Hong Gao
    Journal of Computer Science and Technology, 2016, 31 : 776 - 786
  • [48] Efficient mining of closed high-utility itemsets in dynamic and incremental databases
    Vlashejerdi, Mahnaz Naderi
    Daneshpour, Negin
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2025, 144
  • [49] EFIM: a fast and memory efficient algorithm for high-utility itemset mining
    Zida, Souleymane
    Fournier-Viger, Philippe
    Lin, Jerry Chun-Wei
    Wu, Cheng-Wei
    Tseng, Vincent S.
    KNOWLEDGE AND INFORMATION SYSTEMS, 2017, 51 (02) : 595 - 625
  • [50] EFIM: a fast and memory efficient algorithm for high-utility itemset mining
    Souleymane Zida
    Philippe Fournier-Viger
    Jerry Chun-Wei Lin
    Cheng-Wei Wu
    Vincent S. Tseng
    Knowledge and Information Systems, 2017, 51 : 595 - 625