一次性条件下的三支序列模式挖掘  

One-off three-way sequential patterns mining

作　　者：杨仕琦 武优西 耿萌 李艳[2] YANG Shi-qi;WU You-xi;GENG Meng;LI Yan(School of Artificial Intelligence,Hebei University of Technology,Tianjin 300401;School of Economics and Management,Hebei University of Technology,Tianjin 300401,China)

机构地区：[1]河北工业大学人工智能与数据科学学院,天津300401 [2]河北工业大学经济管理学院,天津300401

出　　处：《计算机工程与科学》2024年第7期1286-1295,共10页Computer Engineering & Science

基　　金：河北省自然科学基金(F2020202013)。

摘　　要：一次性条件下的序列模式挖掘旨在从序列数据中挖掘出带有间隙约束的重复序列模式。然而,现有方法不考虑用户的兴趣度,将序列中的每个字符视作同等重要,导致许多用户不感兴趣的冗余模式被发现。为了解决这个问题,将三支决策思想引入序列模式挖掘领域,提出了一次性条件下的三支序列模式挖掘问题及其求解算法。在支持度计算方面,该算法基于深度优先搜索和回溯的策略,结合三支模式的特点以高效求解模式支持度。在候选模式生成方面,该算法采用模式连接策略缩减候选模式数量。此外,该算法还采用了并行化方案充分利用现代处理器的多核性能,提高算法的挖掘效率。最后,实验结果验证了研究一次性条件下的三支序列模式挖掘问题的意义和算法的高效性。One-off sequential pattern mining aims to mining repetitive sequential patterns with gap constraints from sequence.However,current methods do not consider the users’degree of interest,and treat each character in the sequence equally,which leads to mining many redundant patterns that are uninteresting to users.In order to solve this problem,proposed the one-off three-way sequential pattern(OTP)mining problem by introducing the concept of three-way decision and its efficient solution algorithm OTPM.In terms of support calculation,OTPM algorithm is based on the depth-first search and backtracking strategy,and combines the characteristics of three-way patterns to efficiently solve the support of patterns.In the generation of candidate patterns,OTPM algorithm uses a pattern join strategy to reduce the number of candidate patterns.In addition,a parallelization scheme also is used in OTPM algorithm,improve the mining efficiency of the algorithm by taking full advantage of the multi-core performance of modern processors.Finally,the experimental results verify the significance of studying the OTP mining problem and the efficiency of the OTPM algorithm.

关 键 词：序列模式挖掘 三支决策 三支序列模式 一次性 并行化算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]