一般间隙与One-Off条件的序列模式匹配
作者:
作者单位:

作者简介:

刘慧婷(1978-),女,安徽阜阳人,博士,副教授,CCF专业会员,主要研究领域为数据挖掘,机器学习;黄厚柱(1991-),男,硕士,主要研究领域为模式匹配,序列挖掘;刘志中(1990-),男,硕士,主要研究领域为模式匹配,序列挖掘;吴信东(1963-),男,博士,教授,博士生导师,主要研究领域为数据挖掘,基于知识的系统,万维网络信息探索.

通讯作者:

刘慧婷,E-mail:htliu@ahu.edu.cn

中图分类号:

TP181

基金项目:

国家重点研发计划(2016YFB1000901);国家自然科学基金(61202227)


Sequential Pattern Matching with General Gap and One-Off Condition
Author:
Affiliation:

Fund Project:

National Key Research and Development Program of China (2016YFB1000901); National Natural Science Foundation of China (61202227)

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    带有间隙约束的模式匹配问题是序列模式挖掘的关键问题之一.目前,大多数的研究都为非负间隙,对字符串中每个字符的出现顺序有着严格的要求.为了增加匹配的灵活性,并且考虑到在序列模式挖掘中采用one-off条件更加合理,研究一般间隙与one-off条件下的模式匹配问题.该问题为NP-Hard问题.为了有效地求解该问题,提出了MSAING(maximum sequential pattern matching with one-off and general gaps condition)算法:首先,利用Reverse策略使模式与序列达到最佳的匹配状态;然后,使用线性表的结构使匹配过程中消耗的时间和空间大幅度地降低,同时,利用回溯机制提高匹配的成功率;最后,根据inside_Checking机制判断模式串是否会产生内部重复现象,以进一步提高算法的执行效率.理论证明了MSAING算法的完备性,实验结果验证了MSAING算法匹配结果的准确性以及在时间和空间方面的高效性.

    Abstract:

    Pattern matching with gap constraints is one of the key issues of sequential pattern mining. Recently, most research work focuses on pattern matching with non-negative gaps, but the rule strictly limits the order that each character appears in the sequence. In order to increase the flexibility of matching while taking into account that it is more reasonable to use one-off condition in sequential pattern mining, this paper studies the pattern matching problem under general gap and one-off condition, which is NP-hard. To tackle this issue, an algorithm, named MSAING, is proposed. Firstly, the algorithm processes the pattern and sequence using the Reverse strategy to get the maximum number of matching results. Secondly, it significantly reduces the time and space overhead with linear table structure in the matching process, and improves the matching rate using the backtracking method. Finally, to further improve the efficiency of the algorithm, it determines whether internal repetition exists in the pattern or not, according to the inside_Checking mechanism. Completeness of the MSAING algorithm is proved in theory. Experimental results verify the accuracy of the matching results of the MSAING algorithm and its validity in terms of the time and space complexity.

    参考文献
    相似文献
    引证文献
引用本文

刘慧婷,刘志中,黄厚柱,吴信东.一般间隙与One-Off条件的序列模式匹配.软件学报,2018,29(2):363-382

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2016-09-28
  • 最后修改日期:2016-11-23
  • 录用日期:
  • 在线发布日期: 2017-01-23
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号