NTP-Miner: Nonoverlapping Three-Way Sequential Pattern Mining

Youxi Wu, L. Luo, Yan Li, Lei Guo, Philippe Fournier-Viger, Xingquan Zhu, Xindong Wu
{"title":"NTP-Miner: Nonoverlapping Three-Way Sequential Pattern Mining","authors":"Youxi Wu, L. Luo, Yan Li, Lei Guo, Philippe Fournier-Viger, Xingquan Zhu, Xindong Wu","doi":"10.1145/3480245","DOIUrl":null,"url":null,"abstract":"Nonoverlapping sequential pattern mining is an important type of sequential pattern mining (SPM) with gap constraints, which not only can reveal interesting patterns to users but also can effectively reduce the search space using the Apriori (anti-monotonicity) property. However, the existing algorithms do not focus on attributes of interest to users, meaning that existing methods may discover many frequent patterns that are redundant. To solve this problem, this article proposes a task called nonoverlapping three-way sequential pattern (NTP) mining, where attributes are categorized according to three levels of interest: strong, medium, and weak interest. NTP mining can effectively avoid mining redundant patterns since the NTPs are composed of strong and medium interest items. Moreover, NTPs can avoid serious deviations (the occurrence is significantly different from its pattern) since gap constraints cannot match with strong interest patterns. To mine NTPs, an effective algorithm is put forward, called NTP-Miner, which applies two main steps: support (frequency occurrence) calculation and candidate pattern generation. To calculate the support of an NTP, depth-first and backtracking strategies are adopted, which do not require creating a whole Nettree structure, meaning that many redundant nodes and parent–child relationships do not need to be created. Hence, time and space efficiency is improved. To generate candidate patterns while reducing their number, NTP-Miner employs a pattern join strategy and only mines patterns of strong and medium interest. Experimental results on stock market and protein datasets show that NTP-Miner not only is more efficient than other competitive approaches but can also help users find more valuable patterns. More importantly, NTP mining has achieved better performance than other competitive methods in clustering tasks. Algorithms and data are available at: https://github.com/wuc567/Pattern-Mining/tree/master/NTP-Miner.","PeriodicalId":435653,"journal":{"name":"ACM Transactions on Knowledge Discovery from Data (TKDD)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Knowledge Discovery from Data (TKDD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3480245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

Nonoverlapping sequential pattern mining is an important type of sequential pattern mining (SPM) with gap constraints, which not only can reveal interesting patterns to users but also can effectively reduce the search space using the Apriori (anti-monotonicity) property. However, the existing algorithms do not focus on attributes of interest to users, meaning that existing methods may discover many frequent patterns that are redundant. To solve this problem, this article proposes a task called nonoverlapping three-way sequential pattern (NTP) mining, where attributes are categorized according to three levels of interest: strong, medium, and weak interest. NTP mining can effectively avoid mining redundant patterns since the NTPs are composed of strong and medium interest items. Moreover, NTPs can avoid serious deviations (the occurrence is significantly different from its pattern) since gap constraints cannot match with strong interest patterns. To mine NTPs, an effective algorithm is put forward, called NTP-Miner, which applies two main steps: support (frequency occurrence) calculation and candidate pattern generation. To calculate the support of an NTP, depth-first and backtracking strategies are adopted, which do not require creating a whole Nettree structure, meaning that many redundant nodes and parent–child relationships do not need to be created. Hence, time and space efficiency is improved. To generate candidate patterns while reducing their number, NTP-Miner employs a pattern join strategy and only mines patterns of strong and medium interest. Experimental results on stock market and protein datasets show that NTP-Miner not only is more efficient than other competitive approaches but can also help users find more valuable patterns. More importantly, NTP mining has achieved better performance than other competitive methods in clustering tasks. Algorithms and data are available at: https://github.com/wuc567/Pattern-Mining/tree/master/NTP-Miner.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
NTP-Miner:非重叠三向顺序模式挖掘
无重叠序列模式挖掘是一种重要的带间隙约束的序列模式挖掘(SPM),它不仅可以向用户揭示感兴趣的模式,而且利用Apriori(反单调性)特性可以有效地减少搜索空间。然而,现有的算法并不关注用户感兴趣的属性,这意味着现有的方法可能会发现许多冗余的频繁模式。为了解决这个问题,本文提出了一个称为非重叠三向顺序模式(NTP)挖掘的任务,其中根据三个兴趣级别对属性进行分类:强兴趣、中等兴趣和弱兴趣。NTP挖掘可以有效地避免挖掘冗余模式,因为NTP由强兴趣项和中等兴趣项组成。此外,由于缺口约束无法与强烈的利益格局相匹配,NTPs可以避免严重偏差(其发生与其模式显著不同)。为了挖掘ntp,提出了一种有效的NTP-Miner算法,该算法主要分为两个步骤:支持度(出现频率)计算和候选模式生成。为了计算NTP的支持度,采用深度优先和回溯策略,不需要创建整个网络树结构,这意味着不需要创建许多冗余节点和父子关系。因此,提高了时间和空间效率。为了在减少候选模式数量的同时生成候选模式,NTP-Miner采用模式连接策略,只挖掘强烈和中等兴趣的模式。在股票市场和蛋白质数据集上的实验结果表明,NTP-Miner不仅比其他竞争方法更有效,而且可以帮助用户找到更有价值的模式。更重要的是,NTP挖掘在集群任务中取得了比其他竞争方法更好的性能。算法和数据可在:https://github.com/wuc567/Pattern-Mining/tree/master/NTP-Miner。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
Risk factors of ipsilateral breast tumor recurrence in triple-negative or HER2-positive breast cancer patients who achieved pathological complete response after neoadjuvant chemotherapy.
IF 45.3 1区 医学Journal of Clinical OncologyPub Date : 2020-05-25 DOI: 10.1200/jco.2020.38.15_suppl.e12599
Mizuho Tazo, Y. Kojima, A. Yoshida, Sayuka Nakayama, R. Tokui, T. Ogawa, T. Kuwayama, T. Nakayama, H. Yamauchi, K. Tsugawa, Seigo Nakamura, N. Hayashi, M. Ishitobi
Abstract P2-16-27: Risk factors of ipsilateral breast tumor recurrence in primary breast cancer patients who achieved pathological complete response after neoadjuvant chemotherapy
IF 11.2 1区 医学Cancer researchPub Date : 2020-02-15 DOI: 10.1158/1538-7445.sabcs19-p2-16-27
N. Matsuda, N. Hayashi, R. Tokui, T. Nakayama, H. Yamauchi, M. Ishitobi
Risk Factors Predictive of Recurrence and Progression for Patients Who Suffered Initial Recurrence After Transurethral Resection of Stage pT1 Bladder Tumor in Chinese Population: A Retrospective Study
IF 1.6 4区 医学MedicinePub Date : 2016-02-01 DOI: 10.1097/MD.0000000000002625
Zhonghua Shen, Linguo Xie, Tao Chen, Dawei Tian, Xiaoteng Liu, Hao Xu, Yu Zhang, Zhouliang Wu, N. Sha, Chen Xing, Na Ding, Hailong Hu, Chang-li Wu
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Machine Learning-based Short-term Rainfall Prediction from Sky Data Incremental Feature Spaces Learning with Label Scarcity Multi-objective Learning to Overcome Catastrophic Forgetting in Time-series Applications Combining Filtering and Cross-Correlation Efficiently for Streaming Time Series Segment-Wise Time-Varying Dynamic Bayesian Network with Graph Regularization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1