Frequent Pattern Mining Research Articles

Discovering temporal frequent patterns: An optimized approach

Temporal frequent pattern mining is a critical area of data mining that focuses on identifying recurring set of events over time. Traditional methods often face challenges related to scalability, data complexity, and noise, necessitating the development of optimized approaches. This survey reviews the existing literature on temporal frequent pattern mining, highlights the limitations of traditional techniques, and presents recent advancements in optimized methods. The paper also discusses future directions and applications across various domains.

Frequent Pattern Associative Rules in Multiple Dimensions

This paper explores frequent pattern mining in multidimensional data and its extension beyond traditional one-dimensional approaches. While association rule mining is widely used in market basket analysis, its application to multidimensional datasets presents new challenges due to the increased complexity and sparsity of the data. This research reviews existing multidimensional mining techniques, focusing on frequent pattern associative rules, and evaluates their performance. Several real-world applications, such as business intelligence, healthcare analytics, and sensor networks, are discussed. The paper also proposes a framework for efficient pattern discovery and suggests areas for future research

A fast and highly scalable frequent pattern mining algorithm

As the use of big data and its potential benefits become more widespread, public and private organizations around the world have realized the imperative of incorporating comprehensive and robust technologies into their business processes. In particular, companies are implementing more and more intelligent systems into their business processes, resulting in an exponential increase in the amount of data being collected and used in everyday life on a quarterly basis. Therefore, an algorithm that can efficiently explore the frequent patterns from big data will be able to productively analyze and utilize the generated data to better optimize resources and even develop new business models. Thus, in this urban data era, it is not only essential to make more efficient and accurate decisions to improve business profitability and customer satisfaction, but also a highly challenging core issue. In this study, a new approach, scalable FP mining, is proposed for the first time to achieve a certain level of performance and more efficient memory utilization despite large amounts of data. Experiment results for different data characteristics show that the best performance of the proposed method requires only 48.9% of the DP algorithm's execution time. In further experiments with increased exploration difficulty, the optimal execution time is only 37%. On specific associated databases, the proposed method maintains stable and excellent performance with 12.7% for different data characteristics. The experimental results with increasing exploration difficulty at each stage demonstrate the stability, robustness, and reliability of the proposed SFP, especially under high data complexity and exploration difficulty.

Identification and threshold analysis of strong winds and heavy rain disaster factors based on frequent-pattern mining

Meteorological disasters pose a significant challenge to megacities, and quantitatively identifying the influence of meteorological conditions on disasters is an urgent issue. Compared to other traditional datasets, disaster reporting data offers significant informational value for urban meteorological risk response and assessment due to its high credibility and timeliness. This study is based on meteorological disaster reporting data for Shanghai over the past 10 years and focuses on the identification and threshold analysis of meteorological disaster risk factors for disaster-affected entities, offering a novel perspective on analyzing disaster-causing risk under the combined influence of meteorological conditions. The findings suggest that disaster reporting data can be used for meteorological risk assessment. There were noticeable differences in the disaster thresholds for affected entities in central urban areas (city center) versus suburban areas (suburbs). The combined effects of strong winds and heavy rain were often significant contributors to the occurrence of disasters. Furthermore, several distinct disaster characteristics were identified through frequent pattern (FP)-growth mining. The results of this study provide technical support for early warning and disaster management under specific weather conditions by constructing a quantitative framework for understanding the impact of hazardous weather.

MLC-miner: Efficiently discovering multi-level closed high utility patterns from quantitative hierarchical transaction databases

High utility pattern mining (HUPM) extends frequent pattern mining (FPM) by including item significance and quantity, which determine their utility, in transaction databases. A pattern is a high utility if its utility satisfies the minimum threshold. Several efficient approaches have been developed to address this task. However, more extensive databases combined with lower thresholds can lead to an explosion in the number of discovered patterns. Use the closed version of the pattern to decrease patterns while keeping information. To improve real-world applicability, HUPM research now considers item connections. Categorizing items creates an abstraction model that can help decision-makers. This new mining task is generalized high utility pattern mining (GHUPM). However, GHUPM significantly increases the complexity of the mining task, resulting in longer mining times, higher memory usage, and a more significant number of discovered patterns. To date, none of the proposed approaches in GHUPM have utilized the closed representation to shrink the size of the result set. This study introduces MLC-Miner, a multi-level closed high utility pattern extraction technique, to fill this research gap. MLC-Miner combines several efficient methods to enhance mining performance and reduce memory footprints. Experimental results show that MLC-Miner can handle up to 5 million transactions efficiently.

Community detection based on improved user interaction degree, weighted quasi-local path-based similarity and frequent pattern mining

Community detection based on improved user interaction degree, weighted quasi-local path-based similarity and frequent pattern mining

A related degree-based frequent pattern mining algorithm for railway fault data

It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining algorithm. However, high utility quantitative frequent pattern mining algorithms in the field of data mining still suffer from the problems of low time-memory performance and are not easy to scale up. In the context of such needs, we propose a related degree-based frequent pattern mining algorithm, named Related High Utility Quantitative Item set Mining (RHUQI-Miner), to enable the effective mining of railway fault data. The algorithm constructs the item-related degree structure of fault data and gives a pruning optimization strategy to find frequent patterns with higher related degrees, reducing redundancy and invalid frequent patterns. Subsequently, it uses the fixed pattern length strategy to modify the utility information of the item in the mining process so that the algorithm can control the length of the output frequent pattern according to the actual data situation and further improve the performance and practicability of the algorithm. The experimental results on the real fault dataset show that RHUQI-Miner can effectively reduce the time and memory consumption in the mining process, thus providing data support for differentiated and precise maintenance strategies.

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.

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.

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.

Deciphering Patterns in a small scale Case Analysis Study of the Apriori Algorithm in Market Basket Analysis using machine learning tools

Analysis of Transaction Database Using Apriori Algorithm. This study examines the use of the Apriori algorithm for analysing transaction databases. The Apriori algorithm is a fundamental technique in data mining that allows for the efficient discovery of frequent patterns and association rules in large datasets. The Apriori algorithm employs a two-step approach. Initially, it identifies frequent items in the database based on a user-defined minimum support threshold. Subsequently, it generates association rules that describe relationships between these frequent items based on metrics such as confidence and lift. This paper provides an in-depth explanation of the Apriori algorithm, emphasizing its strengths and limitations. Additionally, it presents various applications of the Apriori algorithm in real-world scenarios, such as shopping cart analysis, cross-selling and upselling, and customer segmentation. The significance of this study lies in its comprehensive analysis of the Apriori algorithm and its practical relevance in diverse data mining tasks. It serves as a valuable resource for researchers, practitioners, and anyone seeking to understand the fundamentals and applications of association rule mining. Keywords: Datamining, OLTP, Apriori algorithm, Item sets and Market Basket Analysis

Distributed Approach for Efficiently Extracting Common Patterns from Large Datasets

Abstract: In recent years, advancements in database knowledge discovery have enabled it to find important and practical information with great force. Frequent pattern mining and association rule mining has been thoroughly investigated for a great range of real-world applications. Traditional mining algorithms use memory-resident, centralised data. The performance is not effective enough when applying these methods to remote databases because of the large amount of data, bandwidth limitation, and energy limitations, especially in this era of big data. Datamining in dispersed contexts has therefore become a significant field of study.

X-FSPMiner: A Novel Algorithm for Frequent Similar Pattern Mining

Frequent similar pattern mining (FSP mining) allows for finding frequent patterns hidden from the classical approach. However, the use of similarity functions implies more computational effort, necessitating the development of more efficient algorithms for FSP mining. This work aims to improve the efficiency of mining all FSPs when using Boolean and non-increasing monotonic similarity functions. A data structure to condense an object description collection, named FV-Tree , and an algorithm for mining all FSPs from the FV-Tree , named X-FSPMiner , are proposed. The experimental results reveal that the novel algorithm X-FSPMiner vastly outperforms the state-of-the-art algorithms for mining all FSPs using Boolean and non-increasing monotonic similarity functions.

The Research on the Improvement of FP-growth Algorithm

This paper focuses on the issue of low efficiency in the FP-growth algorithm for frequent pattern mining and proposes an improved algorithm, ICFM-growth. Experimental results demonstrate that the improved algorithm outperforms the FP-growth algorithm in terms of both runtime and space utilization. By studying the classical frequent pattern algorithms Apriori and FP-growth, the latter is an improved algo- rithm based on Apriori to address the problems of generating a large number of candidate itemsets and consuming significant memory space. While FP-growth exhibits superior mining efficiency compared to Apriori, it faces challenges when dealing with large and long transactional databases due to the construction of numerous FP-trees, which increases computational tasks and prolongs runtime, leading to lagging mining efficiency. To address this issue, the improved algorithm ICFM-growth is proposed. It constructs a co-occurrence frequency matrix to perform preliminary screening on the transaction set, focusing on high-frequency and co-occurring item pairs, thereby reducing unnecessary computa- tions. In the initial stage, as important item pairs have already been filtered, the algorithm can directly operate on these item pairs and items, rather than the entire dataset, thereby reducing the search space and computational complexity. Additionally, the structure of the FP-tree ena- blesthe algorithm to store and process data more efficiently, avoiding frequent scanning of the entire database, as seen in traditional Apriori algorithms. Finally, through simulation experiments on publicly available datasets such as Movie Data and House Data, validated using cross- validation, the ICFM-growth algorithm proves to be significantly superior to FP-growth in terms of time and space efficiency. It demonstrates faster runtime, lower memory consumption, and superior mining efficiency compared to FP-growth.

Moving from classical towards machine learning stances for bus passengers’ alighting estimation: A comparison of state-of-the-art approaches in the city of Lisbon

Passenger alighting estimation is a critical task in public transport (PT) management, especially for entry-only Automatic Fare Collection (AFC) transport systems where passenger alighting are not recorded. Effective estimation methods are necessary for trip analysis and route planning, offering valuable insights into passengers’ mobility patterns and, subsequently, improving the quality of service. However, the stochastic nature of passenger behaviour challenges the degree of successful alighting estimates. A classic approach to infer the alighting stops of passengers is the use of trip-chaining principles. Since these principles are dispersed across the literature in the field, their comprehensive review is pivotal to establish the best practice for alighting estimation. Still, trip-chaining approaches are unable to infer the alighting of non-commuting passengers. This paper addresses these two research gaps by: i) providing a critical overview of the existing principles and methods for alighting estimation; ii) proposing an approach to improve alighting estimation that consistently integrates the most effective state-of-the-art principles on trip-chaining; and iii) further introducing a frequent pattern mining and density-based clustering solutions to support alighting estimation for non-commuting passengers. Considering the public bus transport in Lisbon city as the guiding case study, the achieved estimation rate by the proposed assembled model is 92%. Moreover, the density-based clustering solution is found to improve the estimation of 11pp against classic trip-chaining principles. Furthermore, the proposed model and acquired results yield actionable value to enhance PT operations and services, ultimately leading to improved bus routing and quality of service.

Constraint-based high utility mobile trajectory pattern mining for security systems

In security system, high utility pattern mining of a large number of users mobile trajectories is helpful to analyze user behavior patterns, and enhance the internal prevention of the security system.Currently, the frequent pattern mining for mobile trajectory in security systems do not take into account the differences in the safety levels between staying points and the frequency of their occurrence. Existing high utility mobile trajectory pattern mining methods are unable to discover staying points that meet specific user requirements. To solve these problems, a constraint-based high utility mobile trajectory mining algorithm is proposed (names as HUIM-ILC-ACO). It takes into account the user’s stay time, stay frequency, and the safety level of each stopping point and calculates the utility value of each staying point by incorporating these factors through weighted computation. Based on this, the algorithm combines ant colony optimization with length constraints and item constraints to construct a method for mining high utility mobile trajectory patterns that better align with user interests. Experimental results on real datasets and a target mobile trajectory RFID dataset show that proposed algorithm is efficient in terms of runtime and pattern quantity, and it can effectively mine a pattern set that is closer to user interests.

Multi-type concept drift detection under a dual-layer variable sliding window in frequent pattern mining with cloud computing

The detection of different types of concept drift has wide applications in the fields of cloud computing and security information detection. Concept drift detection can indeed assist in promptly identifying instances where model performance deteriorates or when there are changes in data distribution. This paper focuses on the problem of concept drift detection in order to conduct frequent pattern mining. To address the limitation of fixed sliding windows in adapting to evolving data streams, we propose a variable sliding window frequent pattern mining algorithm, which dynamically adjusts the window size to adapt to new concept drifts and detect them in a timely manner. Furthermore, considering the challenge of existing concept drift detection algorithms that struggle to adapt to different types of drifting data simultaneously, we introduce an additional dual-layer embedded variable sliding window. This approach helps differentiate types of concept drift and incorporates a decay model for drift adaptation. The proposed algorithm can effectively detect different types of concept drift in data streams, perform targeted drift adaptation, and exhibit efficiency in terms of time complexity and memory consumption. Additionally, the algorithm maintains stable performance, avoiding abrupt changes due to window size variations and ensuring overall robustness.

Privacy preserving rare itemset mining

In recent years, rare pattern mining has shown great vitality in some real-world fields, such as disease diagnosis, criminal behavior analysis, anomaly detection in networks, and so on. When data organizations publish or share information publicly, shared data can be at risk of leakage as data mining techniques may discover sensitive knowledge and information. To keep competitors from obtaining hidden information after processing the database, privacy-preserving data mining (PPDM) has been proposed and studied widely. However, most of the techniques in PPDM are applied to frequent pattern mining and cannot deal with the privacy protection problems in rare pattern mining, such as network vulnerability detection and abnormal medical data. To address this limitation, we introduce a privacy-preserving technique for rare pattern mining. In this paper, two novel algorithms named Longest Transaction-Minimum Item Number (LT-MIN) and Longest Transaction-Maximum Item Number (LT-MAX) are proposed to hide sensitive rare itemsets and return the sanitized database. These two algorithms succeed in hiding target itemsets while minimizing the side effects on the original database. What's more, they employ a projection mechanism to reduce the time spent scanning the database. Besides using the traditional evaluation criteria in PPDM, we also propose two additional similarity measures to evaluate the performance from the perspective of the itemsets and the structural integrity of the database. The experimental results indicate that the proposed algorithms can hide sensitive rare itemsets successfully and efficiently, and the evaluation methods used can become the evaluation criteria for privacy-preserving rare itemset mining (PPRIM).