P-FCloHUS: A Parallel Approach for Mining Frequent Closed High-Utility Sequences on Multi-core Processors

被引:0
|
作者
Hong-Phat Nguyen [1 ,2 ]
Bac Le [1 ,2 ]
机构
[1] Univ Sci, Fac Informat Technol, Ho Chi Minh City, Vietnam
[2] Vietnam Natl Univ, Ho Chi Minh City, Vietnam
关键词
Data mining; High-utility sequential pattern mining; Frequent closed sequence mining; Multi-core processors; Parallel mining;
D O I
10.1007/978-981-19-8234-7_31
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Frequent closed high-utility (FCHU) sequences are preferable to frequent closed sequences. Not only because of their utility-based nature that considerately contributes to taking decisive business actions, FCHU sequences also preserve necessary information for re-constructing frequent high-utility sequences. Despite of their vital role, mining FCHU sequences is a time consuming task when facing with large-scale datasets, or especially when the input thresholds are relatively small. To contend with these difficulties, this paper proposes a parallel algorithm named P-FCloHUS for fast mining FCHU sequences by making good use of multi-core processors. By relying on a novel Single scan synchronization strategy that is facilitated by an efficiently Partitioned result space structure, P-FCloHUS successfully alleviates the communication cost between mining tasks and hence speeds up the parallel mining process. Experiments on both dense and sparse datasets show that P-FCloHUS outperforms the state-of-the-art FMaxCloHUSM in terms of runtime performance.
引用
下载
收藏
页码:396 / 408
页数:13
相关论文
共 22 条
  • [11] An Efficient Mining Algorithm of Closed Frequent Itemsets on Multi-core Processor
    Phan, Huan
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2019, 2019, 11888 : 107 - 118
  • [12] FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences
    Tin Truong
    Hai Duong
    Bac Le
    Fournier-Viger, Philippe
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2019, 85 : 1 - 20
  • [13] 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
  • [14] An Adaptive Memory Conscious Approach for Mining Frequent Trees Implications for Multi-core Architectures
    Tatikonda, Shirish
    Parthasarathy, Srinivasan
    PPOPP'08: PROCEEDINGS OF THE 2008 ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2008, : 263 - 264
  • [15] Towards a Parallel Approach for Incremental Mining of Functional Dependencies on Multi-core Systems
    Gasmi, Ghada
    Slimani, Yahya
    Lakhal, Lotfi
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT I: 15TH INTERNATIONAL CONFERENCE, KES 2011, 2011, 6881 : 590 - 598
  • [16] A Closed Itemset Property based Multi-objective Evolutionary Approach for Mining Frequent and High Utility Itemsets
    Cao, Heng
    Yang, Shangshang
    Wang, Qingren
    Wang, Qijun
    Zhang, Lei
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 3356 - 3363
  • [17] A multi-objective evolutionary approach for mining frequent and high utility itemsets
    Zhang, Lei
    Fu, Guanglong
    Cheng, Fan
    Qiu, Jianfeng
    Su, Yansen
    APPLIED SOFT COMPUTING, 2018, 62 : 974 - 986
  • [18] Frequent high-utility sequential pattern mining algorithm for integrated architecture design of multi-platform mission system
    Ni X.
    Wang M.
    Xiao G.
    Wang G.
    Aerospace Systems, 2022, 5 (2) : 331 - 347
  • [19] Computing Optimised Parallel Speeded-Up Robust Features (P-SURF) on Multi-Core Processors
    Nan Zhang
    International Journal of Parallel Programming, 2010, 38 : 138 - 158
  • [20] Computing Optimised Parallel Speeded-Up Robust Features (P-SURF) on Multi-Core Processors
    Zhang, Nan
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2010, 38 (02) : 138 - 158