From basic approaches to novel challenges and applications in Sequential Pattern Mining

IF 1 4区 数学 Q1 MATHEMATICS
A. Bechini, Alessandro Bondielli, Pietro Dell'Oglio, Francesco Marcelloni
{"title":"From basic approaches to novel challenges and applications in Sequential Pattern Mining","authors":"A. Bechini, Alessandro Bondielli, Pietro Dell'Oglio, Francesco Marcelloni","doi":"10.3934/aci.2023004","DOIUrl":null,"url":null,"abstract":"Sequential Pattern Mining (SPM) is a branch of data mining that deals with finding statistically relevant regularities of patterns in sequentially ordered data. It has been an active area of research since mid 1990s. Even if many prime algorithms for SPM have a long history, the field is nevertheless very active. The literature is focused on novel challenges and applications, and on the development of more efficient and effective algorithms. In this paper, we present a brief overview on the landscape of algorithms for SPM, including an evaluation on performances for some of them. Further, we explore additional problems that have spanned from SPM. Finally, we evaluate available resources for SPM, and hypothesize on future directions for the field.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"17 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Research Archive","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3934/aci.2023004","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Sequential Pattern Mining (SPM) is a branch of data mining that deals with finding statistically relevant regularities of patterns in sequentially ordered data. It has been an active area of research since mid 1990s. Even if many prime algorithms for SPM have a long history, the field is nevertheless very active. The literature is focused on novel challenges and applications, and on the development of more efficient and effective algorithms. In this paper, we present a brief overview on the landscape of algorithms for SPM, including an evaluation on performances for some of them. Further, we explore additional problems that have spanned from SPM. Finally, we evaluate available resources for SPM, and hypothesize on future directions for the field.
从顺序模式挖掘的基本方法到新的挑战和应用
顺序模式挖掘(SPM)是数据挖掘的一个分支,它处理在顺序排序的数据中发现模式的统计相关规律。自20世纪90年代中期以来,它一直是一个活跃的研究领域。尽管许多用于SPM的素数算法有很长的历史,但该领域仍然非常活跃。文献集中在新的挑战和应用,以及更高效和有效的算法的发展。在本文中,我们简要概述了SPM算法的概况,包括对其中一些算法的性能评估。此外,我们还探讨了SPM带来的其他问题。最后,我们评估了SPM的可用资源,并对该领域的未来方向进行了假设。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.30
自引率
12.50%
发文量
170
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信