Sequential Pattern Mining Algorithm Research Articles

Sequential pattern mining algorithms and their applications: a technical review

Sequential pattern mining algorithms and their applications: a technical review

Temporal Characterization and Visualization of Revolving Therapy-Events in Lung Cancer Patients.

This paper presents a comprehensive workflow for integrating revolving events into the transitive sequential pattern mining (tSPM+) algorithm and Machine Learning for Health Outcomes (MLHO) framework, emphasizing best practices and pitfalls in its application. We emphasize feature engineering and visualization techniques, demonstrating their efficacy in capturing temporal relationships. Applied to an EGFR lung cancer cohort, our approach showcases reliable temporal insights even in a small dataset. This work highlights the importance of temporal nuances in healthcare data analysis, paving the way for improved disease understanding and patient care.

Unveiling Multi-Agent Strategies: A Data-Driven Approach for Extracting and Evaluating Team Tactics from Football Event and Freeze-Frame Data

Studying collective behavior in opposing multi-agent teams is crucial across game theory, robotics, and sports analytics. In sports, especially football, team tactics involve intricate strategic spatial and action behaviors displayed as event sequences during possession. Understanding and analyzing these tactics is essential for successful training, strategic planning, and on-field success. While traditional approaches, such as notational and statistical analyses, offer valuable insights into team tactics, they often lack a comprehensive consideration of contextual information, thereby limiting the holistic evaluation of teams’ performances. To bridge this gap and capture the nuanced intricacies of team tactics, we employed advanced methodologies. The sequential pattern mining algorithm PrefixSpan was utilized to extract tactical patterns from possession sequences, enabling a deeper understanding of how teams strategize and adapt during play. Additionally, the neural marked spatio temporal point process (NMSTPP) model was leveraged to model and predict team behaviors, facilitating a fair comparison among teams. The evaluation of team possessions was further enhanced through the innovative holistic possession utilization score metrics, providing a more nuanced assessment of performance. In our experimental exploration, we identified and classified five distinct team tactics, validated the efficacy of the NMSTPP model when integrating StatsBomb 360 data, and conducted a comprehensive analysis of English Premier League teams during the 2022/2023 season. The results were visualized using radar plots and scatter plots with mean shift clustering. Lastly, the potential applications to RoboCup were discussed.

Towards Innovation of German Teaching via IoT Assistance and Virtual Classroom

The penetration of virtual classroom teaching into German teaching is the presentation of teaching innovation in the information age. In this work, we explore the necessity of applying virtual classroom teaching in German classrooms and the effective strategies of German teaching innovation in virtual classrooms, to provide some suggestions for the reform of German teaching. First, the GPS trajectories are transformed into a sequence of hotspot regions using the spatiotemporal properties of GPS points. Then, a sequential pattern mining algorithm of asynchronous cycles with multiple minimum supports based on pattern growth is adopted, and the sequential patterns of asynchronous cycles are deeply recursively mined according to the multiple minimum supports. Experiments show that the proposed IoT-assisted teaching scheme can effectively integrate equipment resources, mine spatiotemporal information, and help students and teachers establish a new educational method of integrating space and land. Compared with the baseline, it can fully exploit the characteristics of German.

SPM4GAC: SPM based approach for genome analysis and classification of macromolecules

Genome sequence analysis and classification play critical roles in properly understanding an organism's main characteristics, functionalities, and changing (evolving) nature. However, the rapid expansion of genomic data makes genome sequence analysis and classification a challenging task due to the high computational requirements, proper management, and understanding of genomic data. Recently proposed models yielded promising results for the task of genome sequence classification. Nevertheless, these models often ignore the sequential nature of nucleotides, which is crucial for revealing their underlying structure and function. To address this limitation, we present SPM4GAC, a sequential pattern mining (SPM)-based framework to analyze and classify the macromolecule genome sequences of viruses. First, a large dataset containing the genome sequences of various RNA viruses is developed and transformed into a suitable format. On the transformed dataset, algorithms for SPM are used to identify frequent sequential patterns of nucleotide bases. The obtained frequent sequential patterns of bases are then used as features to classify different viruses. Ten classifiers are employed, and their performance is assessed by using several evaluation measures. Finally, a performance comparison of SPM4GAC with state-of-the-art methods for genome sequence classification/detection reveals that SPM4GAC performs better than those methods.

TaSPM: Targeted Sequential Pattern Mining

Sequential pattern mining (SPM) is an important technique in the field of pattern mining, which has many applications in reality. Although many efficient SPM algorithms have been proposed, there are few studies that can focus on targeted tasks. Targeted querying of the concerned sequential patterns can not only reduce the number of patterns generated, but also increase the efficiency of users in performing related analysis. The current algorithms available for targeted sequence querying are based on specific scenarios and can not be extended to other applications. In this article, we formulate the problem of targeted sequential pattern mining and propose a generic algorithm, namely TaSPM. What is more, to improve the efficiency of TaSPM on large-scale datasets and multiple-item-based sequence datasets, we propose several pruning strategies to reduce meaningless operations in the mining process. Totally four pruning strategies are designed in TaSPM, and hence TaSPM can terminate unnecessary pattern extensions quickly and achieve better performance. Finally, we conducted extensive experiments on different datasets to compare the baseline SPM algorithm with TaSPM. Experiments show that the novel targeted mining algorithm TaSPM can achieve faster running time and less memory consumption.

Deep sequential pattern mining for readability enhancement of Indonesian summarization

In text summarization research, readability is a great issue that must be addressed. Our hypothesis is readability can be accomplished by using text representations that keep the meaning of text documents intact. Therefore, this study aims to combine sequential pattern mining (SPM) in producing a sequence of a word as text representation with unsupervised deep learning to produce an Indonesian text summary called DeepSPM. This research uses PrefixSpan as an SPM algorithm and deep belief network (DBN) as an unsupervised deep learning method. This research uses 18,774 Indonesian news text from IndoSum. The readability aspect is evaluated by recall-oriented understudy for gisting evaluation (ROUGE) as a co-selection-based analysis; Dwiyanto Djoko Pranowo metrics, Gunning fog index (GFI), and Flesch-Kincaid grade level (FKGL) as content-based analysis; and human readability evaluation with two experts. The experiment result shows that DeepSPM yields better than DBN, with the F-measure value of ROUGE-1 enhanced to 0.462, ROUGE-2 is 0.37, and ROUGE-L is 0.41. The significance of ROUGE results also be tested using T-Test. The content-based analysis and human readability evaluation findings are conformable with the findings of co-selection-based analysis that generated summaries are only partially readable or have a medium level of readability aspect.

DRIVE: Dockerfile Rule Mining and Violation Detection

A Dockerfile defines a set of instructions to build Docker images, which can then be instantiated to support containerized applications. Recent studies have revealed a considerable amount of quality issues with Dockerfiles. In this article, we propose a novel approach, Dockerfiles Rule mIning and Violation dEtection ( DRIVE ), to mine implicit rules and detect potential violations of such rules in Dockerfiles. DRIVE first parses Dockerfiles and transforms them to an intermediate representation. It then leverages an efficient sequential pattern mining algorithm to extract potential patterns. With heuristic-based reduction and moderate human intervention, potential rules are identified, which can then be utilized to detect potential violations of Dockerfiles. DRIVE identifies 34 semantic rules and 19 syntactic rules including 9 new semantic rules that have not been reported elsewhere. Extensive experiments on real-world Dockerfiles demonstrate the efficacy of our approach.

CCSMP: an efficient closed contiguous sequential pattern mining algorithm with a pattern relation graph

CCSMP: an efficient closed contiguous sequential pattern mining algorithm with a pattern relation graph

Retracted: Study on the Clinical Characteristics and Treatment of Obstetric Hypertension with Sequence Pattern Mining Algorithm.

[This retracts the article DOI: 10.1155/2021/1072446.].

A priority-aware sequential pattern mining method for detection of compact patterns from alarm floods

Alarm floods are commonly present in modern complex industrial process, and usually degrade the performance of the alarm systems severely. In an alarm flood, the massive alarm messages may overwhelm plant operators and submerge critical alarms, which would further worsen the situation and lead to severe consequences. One effective way to deal with alarm flood situations is to mine meaningful alarm patterns that can be used to configure dynamic alarm suppression modules that suppress irrelevant alarms in alarm floods based on certain conditions or to help with online alarm prediction. Using the existing methods in literature, alarms of higher priorities could be easily overlooked in the pattern mining as they usually appear less frequent; thus, it makes the results become unreliable. Motivated by this issue, this paper proposes a new pattern mining method to extract priority-aware compact alarm patterns from historical alarm flood sequences. The main contributions of this study are twofold: (1) a priority-aware sequential pattern mining algorithm is designed to mine alarm sequential patterns using a closed sequential pattern mining algorithm with alarm priority information incorporated; (2) a pattern compression strategy is proposed to merge similar sequences into compact patterns, making it easier to search for alarm patterns. The effectiveness of the proposed pattern mining method is demonstrated by alarm data generated using a vinyl acetate monomer chemical plant model.

Short-term load forecasting for microgrid energy management system using hybrid SPM-LSTM

Load forecasting in power microgrids and load management systems is still a challenge and needs an accurate method. Although in recent years, short-term load forecasting is done by statistical or learning algorithms. There are still two unsolvable challenges in the conventional data-driven-based prediction methods. The first challenge is that extracting the correlation between metrological and load data still cannot be taken full advantage of, and the other is that extracting patterns independently of the fixed pattern length is not supported. To address these challenges, a fixed SPM-LSTM approach is proposed. SPM for discrete data and LSTM for continuous data. The proposed model uses past consumption, temperature, humidity, wind speed, and weather data. A sequential pattern mining algorithm is used to extract sequential patterns that are independent of the fixed pattern length of correlated data between load and metrological data and can predict only the range of future load. Then, an LSTM network is used for exact load forecasting. It was tested using real data from the consumption and generation data retrieved from the ENTSOE project and its performance was compared with other forecasting methods. Results have shown that the proposed approach with the correlation squared (R2) of 0.951 in the best situation outperformed other methods like LSTM, LSTM-ANN, and CNN-GA. Also, the proposed method reduced training time by one-fifth against others.

In search of similarity in adverse events journeys of patients with left ventricular assist devices

ObjectiveThe Interagency Registry for Mechanically Assisted Circulatory Support (INTERMACS) Event data set contains an expansive collection of longitudinal evidence of the course of adverse events (AEs) of >15,000 patients who have received a left ventricular assist device (LVAD). Buried in the huge Event data set is knowledge that can provide a deeper understanding of the patterns of the “AE journey” of patients with LVAD. Thus, the goal of this study was to examine the Event data set from a comprehensive perspective to identify unique relationships and patterns of AEs, alert potential challenges, and suggest future research directions. MethodsA sequential pattern mining algorithm called SPADE (ie, Sequential PAttern Discovery using Equivalence classes) was applied to 86,912 recorded AEs of 15,820 patients with a continuous-flow LVAD between 2008 and 2016, extracted from the publicly accessible INTERMACS registry. The patterns of AE journey were investigated by posing 5 descriptive research questions about most common types of AE, concomitant AEs, AE sequences, AE subsequences, and interesting relations between AEs. ResultsThe analysis revealed several characteristics of patterns of the AE journey of patients who received an LVAD that accounts for the types and temporal ordering of successive AEs, combinations of AEs, and their timing after surgery. ConclusionsThe high diversity and sparsity of the types and timing of AE occurrences make the AE journeys of patients dissimilar from each other, impeding the discovery of highly-patterned AE journeys among the patients. This study suggests 2 salient directions for future studies to tackle this issue using cluster analysis to cluster patients into more similar groups and translate these results into a practical clinical tool to forecast the next AE based on the history of previous AEs.

Temporal characterization of Alzheimer's Disease with sequences of clinical records.

Alzheimer's Disease (AD) is a complex clinical phenotype with unprecedented social and economic tolls on an ageing global population. Real-world data (RWD) from electronic health records (EHRs) offer opportunities to accelerate precision drug development and scale epidemiological research on AD. A precise characterization of AD cohorts is needed to address the noise abundant in RWD. We conducted a retrospective cohort study to develop and test computational models for AD cohort identification using clinical data from 8 Massachusetts healthcare systems. We mined temporal representations from EHR data using the transitive sequential pattern mining algorithm (tSPM) to train and validate our models. We then tested our models against a held-out test set from a review of medical records to adjudicate the presence of AD. We trained two classes of Machine Learning models, using Gradient Boosting Machine (GBM), to compare the utility of AD diagnosis records versus the tSPM temporal representations (comprising sequences of diagnosis and medication observations) from electronic medical records for characterizing AD cohorts. In a group of 4985 patients, we identified 219 tSPM temporal representations (i.e., transitive sequences) of medical records for constructing the best classification models. The models with sequential features improved AD classification by a magnitude of 3-16 percent over the use of AD diagnosis codes alone. The computed cohort included 663 patients, 35 of whom had no record of AD. Six groups of tSPM sequences were identified for characterizing the AD cohorts. We present sequential patterns of diagnosis and medication codes from electronic medical records, as digital markers of Alzheimer's Disease. Classification algorithms developed on sequential patterns can replace standard features from EHRs to enrich phenotype modelling. National Institutes of Health: the National Institute on Aging (RF1AG074372) and the National Institute of Allergy and Infectious Diseases (R01AI165535).

A Novel Process Recommendation Method That Integrates Disjoint Paths and Sequential Patterns

As the primary means of modern enterprise management, business process management (BPM) technology has become the mainstream development trend of modern enterprise management. The efficient and accurate establishment of business processes is essential for effective BPM. However, the traditional manual-based modeling approach is time-consuming and error-prone. To overcome this, process recommendation technology can improve the intelligence and efficiency of modeling to a certain extent. However, existing process modeling recommendation methods suffer from the problem of low accuracy and neglecting short-process models. Therefore, a novel process modeling recommendation method that integrates disjoint paths and sequential patterns was proposed. This method uses edge-disjoint paths for the first time to represent the behavioral semantics of processes, and an improved contiguous sequential pattern mining algorithm was proposed to mine the contiguous path sequential patterns (CPSPs) of edge-disjoint paths. In the process modeling recommendation stage, the k CPSPs with the highest matching degree with the current reference model process were calculated, and the last node in these CPSPs was used as the set of recommendation nodes. In cases with CPSPs with the same matching degree, the one with the higher value was recommended according to their corresponding lift, confidence, and support degrees. Through experimental evaluation and comparison, it was shown that the proposed method effectively improved the accuracy of the recommendation of both short-process and long-process models while ensuring effectiveness and time efficiency.

On the big data processing algorithms for finding frequent sequences

AbstractSequential pattern mining algorithms extract trendy sequence appearances inside ordered transactional datasets such as market basket datasets. There is a lack of research employing big data processing techniques to locate frequent sequences on large‐scale datasets. Furthermore, there is a need for optimized sequential pattern mining algorithms that run on ordered one‐dimensional sequences. We also observe a lack of sequential pattern search studies in the literature, where the focus is centered around multi‐dimensional data sequences. Existing approaches that deal with ordered one‐dimensional datasets suffer from scalability issues as the amount of data to be analyzed is enormous. This research investigates the big data processing techniques used to find frequent sequences in large‐scale datasets. It also proposes a scalable sequence pattern mining algorithm called Sequential Pattern Acquisition by Reducing Search Space (SPARSS) designed for distributed data processing systems that efficiently handle large datasets containing sequential one‐element data. It introduces a prototype implementation of SPARSS and provides information on the SPARSS's memory and time requirements, which were calculated as part of experimental studies on a real‐world dataset. The results confirm our expectations and demonstrate SPARSS's superior scalability and run‐time efficiency compared to other distributed algorithms.

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

<abstract><p>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.</p></abstract>

Design of an English Web-based Teaching Resource Sharing Platform based on Mobile Web Technology

Thanks to the booming technology of computers and multimedia, student-centered online teaching resource platforms have become an important way for students to learn. However, English teaching resource platforms at the present stage fail to effectively integrate the massive and scattered learning resources. Based on this, the study proposes an English online teaching resource sharing platform based on mobile Web technology, using the SOAP protocol to deploy heterogeneous data resources as Web services to achieve interchangeability between heterogeneous resources. In addition, to enhance the efficient use of learning resources by students, the study proposes a hybrid algorithm based on collaborative filtering algorithm and sequential pattern mining algorithm to achieve personalized sequential recommendation for students. The results show that the platform created by the study exhibits excellent performance in terms of resource transfer capability, achieves efficient teaching resource sharing in a short response time and also shows that the proposed recommendation algorithm is highly accurate.

Hybrid Recommender System for Mental Illness Detection in Social Media Using Deep Learning Techniques.

Recommender systems are chiefly renowned for their applicability in e-commerce sites and social media. For system optimization, this work introduces a method of behaviour pattern mining to analyze the person's mental stability. With the utilization of the sequential pattern mining algorithm, efficient extraction of frequent patterns from the database is achieved. A candidate sub-sequence generation-and-test method is adopted in conventional sequential mining algorithms like the Generalized Sequential Pattern Algorithm (GSP). However, since this approach will yield a huge candidate set, it is not ideal when a large amount of data is involved from the social media analysis. Since the data is composed of numerous features, all of which may not have any relation with one another, the utilization of feature selection helps remove unrelated features from the data with minimal information loss. In this work, Frequent Pattern (FP) mining operations will employ the Systolic tree. The systolic tree-based reconfigurable architecture will offer various benefits such as high throughput as well as cost-effective performance. The database's frequently occurring item sets can be found by using the FP mining algorithms. Numerous research areas related to machine learning and data mining are fascinated by feature selection since it will enable the classifiers to be swift, more accurate, and cost-effective. Over the last ten years or so, there have been significant technological advancements in heuristic techniques. These techniques are beneficial because they improve the search procedure's efficiency, albeit at the potential sacrifice of completeness claims. A new recommender system for mental illness detection was based on features selected using River Formation Dynamics (RFD), Particle Swarm Optimization (PSO), and hybrid RFD-PSO algorithm is proposed in this paper. The experiments use the depressive patient datasets for evaluation, and the results demonstrate the improved performance of the proposed technique.

Retraction Note: Intrusion detection and performance simulation based on improved sequential pattern mining algorithm

Retraction Note: Intrusion detection and performance simulation based on improved sequential pattern mining algorithm