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.