A Survey of Parallel Sequential Pattern Mining
Wensheng Gan, Jerry Chun-Wei Lin, Philippe Fournier-Viger, Han-Chieh, Chao, Philip S. Yu

TL;DR
This survey comprehensively reviews parallel sequential pattern mining methods, categorizing traditional and state-of-the-art approaches, discussing advanced topics, and highlighting challenges and opportunities in handling large-scale data.
Contribution
It provides an in-depth categorization and analysis of existing parallel sequential pattern mining algorithms and discusses future research directions.
Findings
Detailed categorization of serial and parallel SPM approaches
Analysis of advanced topics like weighted and uncertain data
Identification of challenges and opportunities in big data context
Abstract
With the growing popularity of shared resources, large volumes of complex data of different types are collected automatically. Traditional data mining algorithms generally have problems and challenges including huge memory cost, low processing speed, and inadequate hard disk space. As a fundamental task of data mining, sequential pattern mining (SPM) is used in a wide variety of real-life applications. However, it is more complex and challenging than other pattern mining tasks, i.e., frequent itemset mining and association rule mining, and also suffers from the above challenges when handling the large-scale data. To solve these problems, mining sequential patterns in a parallel or distributed computing environment has emerged as an important issue with many applications. In this paper, an in-depth survey of the current status of parallel sequential pattern mining (PSPM) is investigated…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
