Pattern Mining Research Articles

A learning analytics‐based collaborative conversational agent to foster productive dialogue in inquiry learning

AbstractBackgroundSustaining productive student–student dialogue in online collaborative inquiry learning is challenging, and teacher support is limited when needed in multiple groups simultaneously. Collaborative conversational agents (CCAs) have been used in the past to support student dialogue. Yet, research is needed to reveal the characteristics and effectiveness of such agents.ObjectivesTo investigate the extent to which our analytics‐based Collaborative Learning Agent for Interactive Reasoning (Clair) can improve the productivity of student dialogue, we assessed both the levels at which students shared thoughts, listened to each other, deepened reasoning, and engaged with peer's reasoning, as well as their perceived productivity in terms of their learning community, accurate knowledge, and rigorous thinking.MethodIn two separate studies, 19 and 27 dyads of secondary school students from Brazil and the Netherlands, respectively, participated in digital inquiry‐based science lessons. The dyads were assigned to two conditions: with Clair present (treatment) or absent (control) in the chat. Sequential pattern mining of chat logs and the student's responses to a questionnaire were used to evaluate Clair's impact.ResultsAnalysis revealed that in both studies, Clair's presence resulted in dyads sharing their thoughts at a higher frequency compared to dyads that did not have Clair. Additionally, in the Netherlands' study, Clair's presence led to a higher frequency of students engaging with each other's reasoning. No differences were observed in students' perceived productivity.ConclusionThis work deepens our understanding of how CCAs impact student dialogue and illustrates the importance of a multidimensional perspective in analysing the role of CCAs in guiding student dialogue.

IMVis: Visual analytics for influence maximization algorithm evaluation in hypergraphs

Influence maximization (IM) algorithms play a significant role in hypergraph analysis tasks, such as epidemic control analysis, viral marketing, and social influence analysis, and various IM algorithms have been proposed. The main challenge lies in IM algorithm evaluation, due to the complexity and diversity of the spreading processes of different IM algorithms in different hypergraphs. Existing evaluation methods mainly leverage statistical metrics, such as influence spread, to quantify overall performance, but do not fully unravel spreading characteristics and patterns. In this paper, we propose an exploratory visual analytics system, IMVis, to assist users in exploring and evaluating IM algorithms at the overview, pattern, and node levels. A spreading pattern mining method is first proposed to characterize spreading processes and extract important spreading patterns to facilitate efficient analysis and comparison of IM algorithms. Novel visualization glyphs are designed to comprehensively reveal both temporal and structural features of IM algorithms’ spreading processes in hypergraphs at multiple levels. The effectiveness and usefulness of IMVis are demonstrated through two case studies and expert interviews.

Knowledge-assisted adaptive large neighbourhood search algorithm for the satellite–ground link scheduling problem

Communications between satellites and the ground supported by satellite–ground links (SGLs) are indispensable to the daily management of large-scale low-orbit communication satellite constellations. The SGL scheduling problem (SGLSP) focuses on determining which nonconflicting SGLs should be activated to maximize the total linking time. To solve this problem, we build an integer programming (IP) model and simultaneously propose a knowledge-assisted adaptive large neighbourhood search algorithm (KA-ALNS) based on this model, unifying the strengths of IP and data mining within the ALNS framework. In this algorithm, IP, which is deeply embedded in the ALNS, is employed to further refine the solution improved by ALNS. Then, a data mining method named frequent pattern mining is employed for extracting knowledge of excellent solutions to construct new solutions. The KA-ALNS algorithm that combines data mining methods and IP modelling can effectively solve the SGLSP. A three-day experimental setting with 20 ground stations in the China region, 40 ground stations in the world region (each station is equipped with 2 antennas), and a constellation containing 168 satellites is conducted. Computational tests with 12 different scale instances indicate that KA-ALNS outperforms two state-of-the-art algorithms given both 10 and 60 min of scheduling time.

A Study of Multi-Step Sparse Vessel Trajectory Restoration Based on Feature Correlation

A Study of Multi-Step Sparse Vessel Trajectory Restoration Based on Feature Correlation

Standard Procedure-Guided Flight Trajectory Pattern Mining for Airport Terminal Airspace

Standard Procedure-Guided Flight Trajectory Pattern Mining for Airport Terminal Airspace

Network-based visualisation of frequent sequences.

Frequent sequence pattern mining is an excellent tool to discover patterns in event chains. In complex systems, events from parallel processes are present, often without proper labelling. To identify the groups of events related to the subprocess, frequent sequential pattern mining can be applied. Since most algorithms provide too many frequent sequences that make it difficult to interpret the results, it is necessary to post-process the resulting frequent patterns. The available visualisation techniques do not allow easy access to multiple properties that support a faster and better understanding of the event scenarios. To answer this issue, our work proposes an intuitive and interactive solution to support this task, introducing three novel network-based sequence visualisation methods that can reduce the time of information processing from a cognitive perspective. The proposed visualisation methods offer a more information rich and easily understandable interpretation of sequential pattern mining results compared to the usual text-like outcome of pattern mining algorithms. The first uses the confidence values of the transitions to create a weighted network, while the second enriches the adjacency matrix based on the confidence values with similarities of the transitive nodes. The enriched matrix enables a similarity-based Multidimensional Scaling (MDS) projection of the sequences. The third method uses similarity measurement based on the overlap of the occurrences of the supporting events of the sequences. The applicability of the method is presented in an industrial alarm management problem and in the analysis of clickstreams of a website. The method was fully implemented in Python environment. The results show that the proposed methods are highly applicable for the interactive processing of frequent sequences, supporting the exploration of the inner mechanisms of complex systems.

Using Permutation Tests to Identify Statistically Sound and Nonredundant Sequential Patterns in Educational Event Sequences

Frequent sequential pattern mining is a valuable technique for capturing the relative arrangement of learning events, but current algorithms often return excessive learning event patterns, many of which may be noise or redundant. These issues exacerbate researchers’ burden when interpreting the patterns to derive actionable insights into learning processes. This study proposed permutation tests for identifying sequential patterns whose occurrences are statistically significantly greater than the chance value and different from their superpatterns. Simulations demonstrated that the test for detecting sound patterns had a low false discovery rate and high power, while the test for detecting nonredundant patterns also showed a high accuracy. Empirical data analyses found that the patterns detected in training data were generalizable to test data.

Optimizing differential expression analysis for proteomics data via high-performing rules and ensemble inference

Identification of differentially expressed proteins in a proteomics workflow typically encompasses five key steps: raw data quantification, expression matrix construction, matrix normalization, missing value imputation (MVI), and differential expression analysis. The plethora of options in each step makes it challenging to identify optimal workflows that maximize the identification of differentially expressed proteins. To identify optimal workflows and their common properties, we conduct an extensive study involving 34,576 combinatoric experiments on 24 gold standard spike-in datasets. Applying frequent pattern mining techniques to top-ranked workflows, we uncover high-performing rules that demonstrate optimality has conserved properties. Via machine learning, we confirm optimal workflows are indeed predictable, with average cross-validation F1 scores and Matthew’s correlation coefficients surpassing 0.84. We introduce an ensemble inference to integrate results from individual top-performing workflows for expanding differential proteome coverage and resolve inconsistencies. Ensemble inference provides gains in pAUC (up to 4.61%) and G-mean (up to 11.14%) and facilitates effective aggregation of information across varied quantification approaches such as topN, directLFQ, MaxLFQ intensities, and spectral counts. However, further development and evaluation are needed to establish acceptable frameworks for conducting ensemble inference on multiple proteomics workflows.

Rethinking the null hypothesis in significant colocation pattern mining of spatial flows

Rethinking the null hypothesis in significant colocation pattern mining of spatial flows

A Scoping Review of Studies Using Artificial Intelligence Identifying Optimal Practice Patterns for Inpatients With Type 2 Diabetes That Lead to Positive Healthcare Outcomes

The objective of this scoping review was to survey the literature on the use of AI/ML applications in analyzing inpatient EHR data to identify bundles of care (groupings of interventions). If evidence suggested AI/ML models could determine bundles, the review aimed to explore whether implementing these interventions as bundles reduced practice pattern variance and positively impacted patient care outcomes for inpatients with T2DM. Six databases were searched for articles published from January 1, 2000, to January 1, 2024. Nine studies met criteria and were summarized by aims, outcome measures, clinical or practice implications, AI/ML model types, study variables, and AI/ML model outcomes. A variety of AI/ML models were used. Multiple data sources were leveraged to train the models, resulting in varying impacts on practice patterns and outcomes. Studies included aims across 4 thematic areas to address: therapeutic patterns of care, analysis of treatment pathways and their constraints, dashboard development for clinical decision support, and medication optimization and prescription pattern mining. Multiple disparate data sources (i.e., prescription payment data) were leveraged outside of those traditionally available within EHR databases. Notably missing was the use of holistic multidisciplinary data (i.e., nursing and ancillary) to train AI/ML models. AI/ML can assist in identifying the appropriateness of specific interventions to manage diabetic care and support adherence to efficacious treatment pathways if the appropriate data are incorporated into AI/ML design. Additional data sources beyond the EHR are needed to provide more complete data to develop AI/ML models that effectively discern meaningful clinical patterns. Further study is needed to better address nursing care using AI/ML to support effective inpatient diabetes management.

Malware Detection and Prevention Using Machine Learning

Abstract: The malware became a serious threat challenge the computing world that requires an immediate consideration to avoid financial and moral blackmail. So, there is a real need for a new method that can detect and stop this type of attack. Most of the previous detection methods followed a dynamic analysis technique which involves a complicated process. The present study proposes a novel method based on static analysis to detect ransomware. The significant characteristic of proposed method is dispensing of disassemble process by direct extraction of features from raw byte with the use of frequent pattern mining which remarkably increases the detection speed. The Gain Ratio technique was used for feature selection which exhibited that 1000 features was the optimal number for detection process. The current study involved using random forest classifier with a comprehensive analysis to the effect of both tree and seed numbers on the ransomware detection. The results showed that tree numbers of 100 with seed number of 1 achieved best results in terms of time-consuming and accuracy. The experimental evaluation revealed that the proposed method could achieve a high accuracy of 97.74% for detection ransomware.

Identifying a good business location using prescriptive analytics: Restaurant location recommendation based on spatial data mining

This study proposes a new prescriptive analytics method that aims to provide decision-makers with a systematic and objective approach to identify suitable locations, considering the spatial distribution of different types of restaurants. The method comprises of two main components: spatial co-location pattern mining and locationGCN, where locationGCN is based on graph convolutional network (GCN). The spatial co-location pattern mining is utilized to capture the spatial correlation of specific restaurant to determine the candidate location selection range. The locationGCN is designed to further screen out final suitable location ranges for the specific restaurant type. A case study using restaurant data from Xiamen Island collected from Dianping.com is conducted. The empirical results demonstrate that the algorithm achieves an accuracy of 74.88%, precision of 63.59%, and recall of 77.48%. Results indicate that the proposed approach can provide suitable location recommendations for specific types of restaurants based on existing restaurant distribution information.

Modification and completion of geological structure knowledge graph based on pattern matching

As a knowledge representation method, knowledge graph is widely used in intelligent question answering systems and recommendation systems. At present, the research on knowledge graph mainly focuses on information query and retrieval based on knowledge graph. In some domain knowledge graphs, specific subgraph structures (patterns) have specific physical meanings. Aiming at this problem, this paper proposes a method and framework of knowledge graph pattern mining based on gat. Firstly, the patterns with specific physical meaning were transformed into subgraph structures containing topological structures and entity attributes. Secondly, the subgraph structure of the pattern is regarded as the query graph, and the knowledge graph is regarded as the data graph, so that the problem is transformed into an approximate subgraph matching problem. Then, the improved relational graph attention network is used to fuse the adaptive edge deletion mechanism to realize the approximate subgraph matching of subgraph structure and attribute, so as to obtain the best matching subgraph. The proposed method is trained in an end-to-end manner. The approximate subgraph matching is realized on the existing data set, and the research work of key pattern mining of complex geological structure knowledge graph is carried out.

DuMato: An efficient warp-centric subgraph enumeration system for GPU

Subgraph enumeration is a heavy-computing procedure that lies at the core of Graph Pattern Mining (GPM) algorithms, whose goal is to extract subgraphs from larger graphs according to a given property. Scaling GPM algorithms for GPUs is challenging due to irregularity, high memory demand, and non-trivial choice of enumeration paradigms. In this work we propose a depth-first-search subgraph exploration strategy (DFS-wide) to improve the memory locality and access patterns across different enumeration paradigms. We design a warp-centric workflow to the problem that reduces divergences and ensures that accesses to graph data are coalesced. A weight-based dynamic workload redistribution is also proposed to mitigate load imbalance. We put together these strategies in a system called DuMato, allowing efficient implementations of several GPM algorithms via a common set of GPU primitives. Our experiments show that DuMato's optimizations are effective and that it enables exploring larger subgraphs when compared to state-of-the-art systems.

A Novel and Efficient Spatio-Temporal Co-location Pattern Mining Algorithm

Colocation pattern mining approaches aim at discovering neighboring relationships of distinct spatial features in geographic and temporal space.With big spatio-temporal dataset, there is large number of patterns often discovered. Then it is of importance to discover meaningful and patterns of interest which come as an aid in applications in use for humans and commercial use. To discover interesting patterns, we present in this article a co-location pattern mining algorithmic framework by considering neighbourhood, clustering, hashing, and mining methods. Neighbourhood relationship describes the closeness between the entities. The results of neighbourhood could be varied by varying the distance threshold. These objects exhibiting neighbouring entities are grouped using clustering technique. Clustering is a classical research approach that produces grouping of the entities. A clustering technique has been presented in the paper for spatio-temporal dimension that offers the advantage of faster grouping based on the neighbourhood relationship. Finally, a hash structure is utilized for faster access and retrieval of patterns. The proposed mining algorithm along with the distance and time threshold efficiently discovers the interesting spatio-temporal patterns and validates the patterns. The experiment conducted shows that the proposed co-location algorithm method yields effective and efficient outcome.

Exploiting Fine-grained Dimming with Improved LiFi Throughput

Optical wireless communication (OWC) shows great potential due to its broad spectrum and the exceptional intensity switching speed of LEDs. Under poor conditions, most OWC systems switch from complex and more error prone high-order modulation schemes to more robust On-Off Keying (OOK) modulation defined in the IEEE OWC standard. This paper presents LiFOD, a high-speed indoor OOK-based OWC system with fine-grained dimming support. While ensuring fine-grained dimming, LiFOD remarkably achieves robust communication at up to 400 Kbps at a distance of 6 meters. This is the first time that the data rate has improved via OWC dimming in comparison to the previous approaches that consider trading off dimming and communication. LiFOD makes two key technical contributions. First, LiFOD utilizes Compensation Symbols (CS) as a reliable side-channel to represent bit patterns dynamically and improve throughput. We firstly design greedy-based bit pattern mining. Then we propose 2D feature enhancement via YOLO model for real-time bit pattern mining. Second, LiFOD synchronously redesigns optical symbols and CS relocation schemes for fine-grained dimming and robust decoding. Experiments on low-cost Beaglebone prototypes with commercial LED lamps and the photodiode (PD) demonstrate that LiFOD significantly outperforms the state-of-the-art system with 2.1× throughput on the SIGCOMM17 data-trace.

Vibration-based anomaly pattern mining for remaining useful life (RUL) prediction in bearings

Vibration-based anomaly pattern mining for remaining useful life (RUL) prediction in bearings

FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP

As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into the complexity of frequent subgraph mining and proposes a frequent subgraph mining (FSM) algorithm. This FSM algorithm is developed within a distributed graph iterative system, designed for the Big Cloud (BC) environment of the China Mobile Corp., and is based on the bulk synchronous parallel (BSP) model, named FSM-BC-BSP. Its aim is to address the challenge of mining frequent subgraphs within a single, large graph. This study advocates for the incorporation of a message sending and receiving mechanism to facilitate data sharing across various stages of the frequent subgraph mining algorithm. Additionally, it suggests employing a standard coded subgraph and sending it to the same node for global support calculation on the large graph. The adoption of the rightmost path expansion strategy in generating candidate subgraphs helps to mitigate the occurrence of redundant subgraphs. The use of standard coding ensures the unique identification of subgraphs, thus eliminating the need for isomorphism calculations. Support calculation is executed using the Minimum Image (MNI) measurement method, aligning with the downward closure attribute. The experimental results demonstrate the robust performance of the FSM-BC-BSP algorithm across diverse input datasets and parameter configurations. Notably, the algorithm exhibits exceptional efficacy, particularly in scenarios with low support requirements, showcasing its superior performance under such conditions.

Uncovering emotion sequence patterns in different interaction groups using deep learning and sequential pattern mining

AbstractBackgroundInvestigating emotion sequence patterns in the posts of discussion forums in massive open online courses (MOOCs) holds a vital role in shaping online interactions and impacting learning achievement. While the majority of research focuses on the relationship between emotions and interactions in MOOC forum discussions, research on identifying the crucial difference in emotion sequence patterns among different interaction groups remains in its infancy.ObjectivesThis research utilizes deep learning and sequential pattern mining to investigate whether there are differences in emotion sequence patterns across different groups of learners who exhibit various types of interactions in online discussion forums.MethodsData from a comprehensive array of sources, including log files, discussion texts and scores from 498 learners in online discussion forums, were collected for this study. The agglomerative hierarchical algorithm is used to classify learners into groups with different levels of interactions. Additionally, we implement and evaluate multiple deep learning models for detecting different emotions from online discussions. Relevant emotion sequence patterns were identified using sequence pattern analysis and the identified emotion sequence patterns were compared across different groups with different levels of interactions.Results and ConclusionsUsing an agglomerative hierarchical algorithm, we classified learners into three distinct groups characterized by different levels of interactions: high, average and low level. Leveraging the bi‐directional long short‐term memory model for emotion detection yielded the highest predictive performance, with an impressive F‐measure of 94.01%, a recall rate of 93.83% and an accuracy score of 95.01%. The results also revealed that learners in the low‐level interaction group experienced more emotion transition from boredom to frustration than the other two groups. Therefore, the aggregation of students into groups and the utilization of their MOOC log data offer educators the capability to provide adaptive emotional feedback, customize assessments and offer more personalized attention as needed.

Structure Mapping Generative Adversarial Network for Multi-View Information Mapping Pattern Mining.

Multi-view learning is dedicated to integrating information from different views and improving the generalization performance of models. However, in most current works, learning under different views has significant independency, overlooking common information mapping patterns that exist between these views. This paper proposes a Structure Mapping Generative adversarial network (SM-GAN) framework, which utilizes the consistency and complementarity of multi-view data from the innovative perspective of information mapping. Specifically, based on network-structured multi-view data, a structural information mapping model is proposed to capture hierarchical interaction patterns among views. Subsequently, three different types of graph convolutional operations are designed in SM-GAN based on the model. Compared with regular GAN, we add a structural information mapping module between the encoder and decoder wthin the generator, completing the structural information mapping from the micro-view to the macro-view. This paper conducted sufficient validation experiments using public imaging genetics data in Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset. It is shown that SM-GAN outperforms baseline and advanced methods in multi-label classification and evolution prediction tasks.