Sequential Pattern Mining Algorithm Research Articles

Using Clustering Analysis and Association Rule Technology in Cross-Marketing

In this paper, according to the perspective of customers and products, by using clustering analysis and association rule technology, this paper proposes a cross-marketing model based on an improved sequential pattern mining algorithm, where an improved algorithm AP (Apriori all PrefixSpan) is applied. The algorithm can reduce the time cost of constructing a projection database and the influence of the increase of support on the algorithm efficiency. The improved idea is that when the first partition is used to generate the projection database, the number of itemsets in the projection database is sorted from small to large, and when the second partition is used, the sequence patterns are generated directly from the mined sequence patterns, so as to reduce the construction of the database. The experimental results show that this method can quickly mine the effective information in complex data sets, improve the accuracy and efficiency of data mining, and occupy less memory consumption, which has good theoretical value and application value.

A Review on Design and Development Of Sequential Patterns Algorithms In Web Usage Mining

In the recent years with the advancement in technology, a lot of information is available in different formats and extracting the knowledge from that data has become a very difficult task. Due to the vast amount of information available on the web, users are finding it difficult to extract relevant information or create new knowledge using information available on the web. To solve this problem Web mining techniques are used to discover the interesting patterns from the hidden data .Web Usage Mining (WUM), which is one of the subset of Web Mining helps in extracting the hidden knowledge present in the Web log files , in recognizing various interests of web users and also in discovering customer behaviours. Web Usage mining includes different phases of data mining techniques called Data Pre-processing, Pattern Discovery & Pattern Analysis. This paper presents an updated focused survey on various sequential pattern mining algorithms like apriori-based algorithm , Breadth First Search-based strategy, Depth First Search strategy, sequential closed-pattern algorithm and Incremental pattern mining algorithm which are used in Pattern Discovery Phase of WUM. At last , a comparison is done based on the important key features present in these algorithms. This study gives us better understanding of the approaches of sequential pattern mining.

Towards a semantic indoor trajectory model: application to museum visits.

In this paper we present a new conceptual model of trajectories, which accounts for semantic and indoor space information and supports the design and implementation of context-aware mobility data mining and statistical analytics methods. Motivated by a compelling museum case study, and by what we perceive as a lack in indoor trajectory research, we combine aspects of state-of-the-art semantic outdoor trajectory models, with a semantically-enabled hierarchical symbolic representation of the indoor space, which abides by OGC’s IndoorGML standard. We drive the discussion on modeling issues that have been overlooked so far and illustrate them with a real-world case study concerning the Louvre Museum, in an effort to provide a pragmatic view of what the proposed model represents and how. We also present experimental results based on Louvre’s visiting data showcasing how state-of-the-art mining algorithms can be applied on trajectory data represented according to the proposed model, and outline their advantages and limitations. Finally, we provide a formal outline of a new sequential pattern mining algorithm and how it can be used for extracting interesting trajectory patterns.

Two-way distributed sequential pattern mining using fruit fly algorithm along with Hadoop and map reduce framework

Data mining is an effective tool used to take out information from big data as it provides several benefits to conquer the restrictions in it. In this paper, we present an innovative procedure developed using an updown directed acyclic graph (UDDAG) with fruit fly optimisation algorithm (FFOA), which is based on sequential pattern (SP) mining algorithm. In this work, the distributed sequential model mining algorithm is used to diminish the scanning time and scalability and the transferred database is employed to optimise the memory storage. The proposed method is used to expand the sequences in both the ends (prefixes and suffixes) of the identified model thereby supplying the consequences in quicker model expansion resulting in fewer database projections when compared to conventional methods. Our proposed method is implemented in Hadoop distributed surroundings to resolve the scalability issues and executed on JAVA platform using big datasets with Hadoop and map reduce framework.

Two Way Distributed Sequential Pattern Mining using Fruitfly Algorithm along with Hadoop and Map Reduce Frame Work

Data mining is an effective tool used to take out information from big data as it provides several benefits to conquer the restrictions in it. In this paper, we present an innovative procedure developed using an updown directed acyclic graph (UDDAG) with fruit fly optimisation algorithm (FFOA), which is based on sequential pattern (SP) mining algorithm. In this work, the distributed sequential model mining algorithm is used to diminish the scanning time and scalability and the transferred database is employed to optimise the memory storage. The proposed method is used to expand the sequences in both the ends (prefixes and suffixes) of the identified model thereby supplying the consequences in quicker model expansion resulting in fewer database projections when compared to conventional methods. Our proposed method is implemented in Hadoop distributed surroundings to resolve the scalability issues and executed on JAVA platform using big datasets with Hadoop and map reduce framework.

GASP: Graph-based Approximate Sequential Pattern Mining for Electronic Health Records.

Sequential pattern mining can be used to extract meaningful sequences from electronic health records. However, conventional sequential pattern mining algorithms that discover all frequent sequential patterns can incur a high computational and be susceptible to noise in the observations. Approximate sequential pattern mining techniques have been introduced to address these shortcomings yet, existing approximate methods fail to reflect the true frequent sequential patterns or only target single-item event sequences. Multi-item event sequences are prominent in healthcare as a patient can have multiple interventions for a single visit. To alleviate these issues, we propose GASP, a graph-based approximate sequential pattern mining, that discovers frequent patterns for multi-item event sequences. Our approach compresses the sequential information into a concise graph structure which has computational benefits. The empirical results on two healthcare datasets suggest that GASP outperforms existing approximate models by improving recoverability and extracts better predictive patterns.

Mining frequent pyramid patterns from time series transaction data with custom constraints

For the problem of mining pyramid scheme patterns, the traditional sequential pattern mining algorithm Prefixspan has many disadvantages such as poor timeliness, uniform threshold, etc. Therefore, we propose a timeliness variable threshold and increment Prefixspan algorithm, named TVI-Prefixspan, for mining the sequential patterns from time series transaction data. To be specific, TVI-Prefixspan aims to mine the patterns that co-occurrence in both an individual sequence and different sequences with high frequency. The most important challenges are how to define the thresholds of frequent one-item and pyramid patterns. We firstly analyze the attributes of the patterns which are hidden in the financial activities between different bank accounts. Secondly, the frequent threshold of each one-item is determined by its different frequency value in normal and pyramid related transaction sequences. We also consider the special relationships in both numerical values and time-series aspects between each pattern’s item. Therefore, TVI-Prefixspan produces the frequent one-item set based on its difference of the normal frequency, and then, mines the pyramid patterns with formulated relation constraints. For describing the correlation, we consider sequential, time interval and one-off constraints simultaneously. The experimental results, in real financial data containing pyramid transactions, show that TVI-Prefixspan algorithm succeeds in mining pyramid scheme patterns quickly and effectively. It is superior to traditional sequential pattern mining algorithms such as Prefixspan in efficiency and mining effect.

Quantized ternary pattern and singular value decomposition for the efficient mining of sequences in SRSI images

The growth and development of particular region over time can be witnessed by remote sensing images. Although such raw images have less possibility to derive the insights, Serial Remote Sensing Images (SRSI) has the large potential to discover the patterns. The evolution of spatial patterns in various areas including urban development, expansion of vegetation cover and agriculture is the evidence for the utilization of SRSI accumulation. The application of conventional sequential pattern-mining algorithms on the SRSI images results in high computational complexity. This issue can be resolved by grouping the pixels and mining sequence patterns. A one-pass framework is introduced to compress and hide the data in the marked stream without any loss. In this paper, we proposed a Quantized ternary pattern based pixel grouping and Singular Value Decomposition—Run Length Coding based pattern mining. The algorithms are experimented using a dataset, namely, the Cropland data layer dataset. The proposed algorithm is efficient in terms of mining time and sequence pattern generation.

ST Sequence Miner: visualization and mining of spatio-temporal event sequences

As a promising field of research, event sequence analysis seems to assist in facilitating clear reasoning behind human decisions by mining reality behind the sequential actions. Mining frequent patterns from event sequences has proved to be promising in extracting actionable insights, which plays an important role in many application domains. Much of the related work challenges the problem solely from the temporal perspective omitting the information that could be gained from the spatial part. This could be in part due to the fact that analysis of event sequences with references to both time and space is attributed as a challenging task due to the additional variance in the data introduced by the spatial aspect. We propose a visual analytics approach that incorporates spatio-temporal pattern extraction leveraging an extended sequential pattern mining algorithm and a pattern discovery guidance mechanism operating on geographic query and selection capabilities. As an implementation of our approach, we introduce a visual analytics tool, namely ST Sequence Miner, enabling event pattern exploration in time-location space. We evaluate our approach over a credit card transaction dataset by adopting case study methodology. Our study unveils that patterns mined from event sequences can better explain possible relationships with proper visualization of time-location data.

An Efficient Algorithm for Extracting High-Utility Hierarchical Sequential Patterns

High-utility sequential pattern mining (HUSPM) is an emerging topic in data mining, where utility is used to measure the importance or weight of a sequence. However, the underlying informative knowledge of hierarchical relation between different items is ignored in HUSPM, which makes HUSPM unable to extract more interesting patterns. In this paper, we incorporate the hierarchical relation of items into HUSPM and propose a two-phase algorithm MHUH, the first algorithm for high-utility hierarchical sequential pattern mining (HUHSPM). In the first phase named Extension, we use the existing algorithm FHUSpan which we proposed earlier to efficiently mine the general high-utility sequences (g-sequences); in the second phase named Replacement, we mine the special high-utility sequences with the hierarchical relation (s-sequences) as high-utility hierarchical sequential patterns from g-sequences. For further improvements of efficiency, MHUH takes several strategies such as Reduction, FGS, and PBS and a novel upper bounder TSWU, which will be able to greatly reduce the search space. Substantial experiments were conducted on both real and synthetic datasets to assess the performance of the two-phase algorithm MHUH in terms of runtime, number of patterns, and scalability. Conclusion can be drawn from the experiment that MHUH extracts more interesting patterns with underlying informative knowledge efficiently in HUHSPM.

RETRACTED ARTICLE: Intrusion detection and performance simulation based on improved sequential pattern mining algorithm

Traditional network intrusion detection algorithm is based on pattern matching, which has made great progress in network intrusion detection system, but the efficiency of this algorithm for data packet matching is quite low. With the rapid increase of Internet scale and capacity, the general information security problem appears, and it brought hidden danger for an open network security. In this paper, the author analyse the intrusion detection and performance simulation based on improved sequential pattern mining algorithm. We integrate the data mining algorithms to implement the IDS, and the simulation result reflects the effectiveness of the methodology. The simulation shows that when minimum support is very small, PrefixSpan running time running a lot less time than other algorithm, and the difference between the two is obvious. Due to the mining algorithm of the relative independence of intrusion detection system, algorithm does not depend on the specific data and specific system, so the intrusion detection system based on data mining to data source requirement is very low.

Mining sequential patterns of PM2.5 pollution between 338 cities in China

Serious PM2.5 air pollution has persistently plagued and endangered most urban areas in China in recent years, and targeted policies are necessary to improve urban air quality ranging from macro policy (national level) to medium policy (city level) to micro policy (site specific). However, the macro-pattern study of air pollution between Chinese cities is inadequate, and not conducive to the formulation of macro-policy. To bridge this gap, we applied a sequential pattern mining algorithm to analyze the spatial-temporal patterns of PM2.5 pollution across Chinese cities during the period 2015 to 2018. The sequential patterns were collected from three levels of granularity on geographic areas and ten temporal scenarios covering time intervals from 10 to 100 h. Many underlying associative relationships were revealed between different cities by the mined patterns. The patterns were heterogeneous and presented five characteristics (i.e., clustering, symmetry, imbalance, decay, and stability). Each of the urban areas under investigation at different granularities was analyzed to identify the occurrence of associative relationships between it and other urban areas; moreover, we determined the degree of severity of such relationships. Our research results provide solid data that can be used as a reference by the various levels of Chinese governments for decision-making; overall, they can be used to improve the design of joint policies to prevent and control PM2.5 pollution in Chinese urban areas.

Efficient algorithms for mining clickstream patterns using pseudo-IDLists

Sequential pattern mining is an important task in data mining. Its subproblem, clickstream pattern mining, is starting to attract more research due to the growth of the Internet and the need to analyze online customer behaviors. To date, only few works are dedicately proposed for the problem of mining clickstream patterns. Although one approach is to use the general algorithms for sequential pattern mining, those algorithms’ performance may suffer and the resources needed are more than would be necessary with a dedicated method for mining clickstreams. In this paper, we present pseudo-IDList, a novel data structure that is more suitable for clickstream pattern mining. Based on this structure, a vertical format algorithm named CUP (Clickstream pattern mining Using Pseudo-IDList) is proposed. Furthermore, we propose a pruning heuristic named DUB (Dynamic intersection Upper Bound) to improve our proposed algorithm. Four real-life clickstream databases are used for the experiments and the results show that our proposed methods are effective and efficient regarding runtimes and memory consumption.

A bee colony optimisation algorithm with a sequential-pattern-mining-based pruning strategy for the travelling salesman problem

The unique foraging behaviour of bees via waggle dance has been computationally realised as an algorithm named bee colony optimisation (BCO) to solve different types of combinatorial optimisation problems such as travelling salesman problem (TSP). In order to enhance the performance of BCO, local optimisation can be integrated. However, local optimisation incurs high processing overhead especially when all solutions are allowed to undergo the local optimisation. This paper proposes a pruning strategy based on the top-k sequential patterns (TKS) mining algorithm. Specifically, TKS is employed to identify the frequent building blocks along the optimisation process. A total of 19 TSP benchmark problem instances ranging from 318 cities to 1,291 cities were used as the test bed. The proposed pruning strategy shows a significant reduction in terms of the computational time to yield TSP solutions with similar tour length as compared with two state-of-the-art approaches.

Pre-Order Post-Order Coded Aggregate Tree based Algorithm for Mining Sequential Patterns

Sequential pattern mining is a data mining approach; aims to discover common interesting patterns in sequence datasets, which attracted a significant research interest due to its real world applications in various fields such as web click stream mining, retail business, stock market and bio-informatics. Each sequence in sequence dataset is composed of time ordered events and each event is an item set. It discovers all frequent subsequences having frequency greater than the given minimum support threshold. Discovering sequential patterns is expensive with respect to mining time as well as the amount of memory used, because of aggressive search space growth due to generation of explosive number of frequent subsequences with the sequence length as well as count of distinct items and large volume of sequence dataset. So, research in this domain aims at developing effective data structures which address frequency counting and large search space as well as scalable algorithms to reduce the execution time and the amount of memory utilized. We propose two efficient data structures called Pre-order Post-order Coded Aggregate Tree (PPCA-Tree) for compact representation of the sequence dataset and Root-node List of First-Occurrence Sub Trees Map (RLFOST-Map) for efficient representation of projected databases. We also developed an efficient Partially ordered Sequential PAttern Mining algorithm called PSPAM and Parallel implementation of Partially ordered Sequential PAttern Mining algorithm called PAPSPAM based on PPCA-Tree using RLFOST-Map which eliminates reconstruction of the projected databases. Experimental analysis done on various synthetic datasets proves that our algorithms PSPAM and PAPSPAM outperform prefixspan and other conventional & state-of-the-art algorithms over dense datasets with better scalability.

Clustering of tourist routes for individual tourists using sequential pattern mining

Grouping individual tourists who have the same or similar tourist routes over the same time period makes it more convenient for the tourists at a low cost by providing transportation means such as regular or occasional tour buses, driver, and tourism guides. In this paper, we propose a mathematical formulation for the tour routes clustering problem and two phases for a sequential pattern algorithm for clustering similar or identical routes according to the tourist routes of individual tourists, with illustrative examples. The first phase is to construct a site by site frequency matrix and prune infrequent tour route patterns from the matrix. The second phase is to perform clustering of the tour routes to determine the tour route using a sequential pattern mining algorithm. We compare and evaluate the performance of our algorithms, i.e., in terms of execution time and memory used. The proposed algorithm is efficient in both runtime and memory usage for the increasing number of transactions.

Distributed mining of high utility time interval sequential patterns using mapreduce approach

High Utility Sequential Pattern mining (HUSP) algorithms aim to find all the high utility sequences from a sequence database. Due to the large explosion of data, recently few distributed algorithms have been designed for mining HUSPs based on the MapReduce framework. However, the existing HUSP algorithms such as USpan, HUS-Span and BigHUSP are able to predict only the order of items, they do not predict the time between the items, that is, they do not include the time intervals between the successive items. But in a real-world scenario, time interval patterns provide more valuable information than conventional high utility sequential patterns. Therefore, we propose a distributed high utility time interval sequential pattern mining (DHUTISP) algorithm using the MapReduce approach that is suitable for big data. DHUTISP creates a novel time interval utility linked list data structure (TIUL) to efficiently calculate the utility of the resulting patterns. Moreover, two utility upper bounds, namely, remaining utility upper bound (RUUB) and co-occurrence utility upper bound (CUUB) are proposed to prune the unpromising candidates. We conducted various experiments to prove the efficiency of the proposed algorithm over both the distributed and non-distributed approaches. The experimental results show the efficiency of DHUTISP over state-of-the-art algorithms, namely, BigHUSP, AHUS-P, PUSOM and UTMining_A.

A personalized POI route recommendation system based on heterogeneous tourism data and sequential pattern mining

Planning a personalized POI route before touring a new city is an important travel preparation activity; however, it is a challenging and time-consuming task for tourists. Although some previous works focus on suggesting POI visit list or sequences, they fail to suggest personalized POI routes due to ignoring multifaceted tourism contexts. Also, they often suffer from tourist cold start or data sparsity problem because of the lack of tourism related data. To address the above weaknesses, we first propose a novel method to integrate heterogeneous tourism data collected from websites to construct a POI knowledgebase and massive structured POI visit sequences. Next, a POI-Visit sequential pattern mining algorithm is proposed to generate various fine-grained candidate POI routes from POI visit sequences while considering various tourism contexts. At the POI route recommendation stage, our system retrieve and rank a list of candidate routes according to the querying tourist’s tourism contexts, including the intended travel duration, the companion type in trip, the visit season and the preferring POI tourism types, etc. In our validation experiments, we select Guilin city in China as an example to construct a real POI knowledgebase which consists of 132 POIs and 8778 POI traffic time, and construct 5694 structured POI visit sequences based on 10,109 downloaded original travelogues. The experimental results demonstrate the advantages of our system in recommending fine-grained and high personalized POI routes for specific tourists.

Constraint-Based Sequential Pattern Mining with Decision Diagrams

Constraint-based sequential pattern mining aims at identifying frequent patterns on a sequential database of items while observing constraints defined over the item attributes. We introduce novel techniques for constraint-based sequential pattern mining that rely on a multi-valued decision diagram (MDD) representation of the database. Specifically, our representation can accommodate multiple item attributes and various constraint types, including a number of non-monotone constraints. To evaluate the applicability of our approach, we develop an MDD-based prefix-projection algorithm and compare its performance against a typical generate-and-check variant, as well as a state-of-the-art constraint-based sequential pattern mining algorithm. Results show that our approach is competitive with or superior to these other methods in terms of scalability and efficiency.

CNN-Based Fault Localization Method Using Memory-Updated Patterns for Integration Test in an HiL Environment

Automotive electronic components are tested via hardware-in-the-loop (HiL) testing at the unit and integration test stages, according to ISO 26262. It is difficult to obtain debugging information from the HiL test because the simulator runs a black-box test automatically, depending on the scenario in the test script. At this time, debugging information can be obtained in HiL tests, using memory-updated information, without the source code or the debugging tool. However, this method does not know when the fault occurred, and it is difficult to select the starting point of debugging if the execution flow of the software is not known. In this paper, we propose a fault-localization method using a pattern in which each memory address is updated in the HiL test. Via a sequential pattern-mining algorithm in the memory-updated information of the transferred unit tests, memory-updated patterns are extracted, and the system learns using a convolutional neural network. Applying the learned pattern in the memory-updated information of the integration test can determine the fault point from the normal pattern. The point of departure from the normal pattern is highlighted as a fault-occurrence time, and updated addresses are presented as fault candidates. We applied the proposed method to an HiL test of an OSEK/VDX-based electronic control unit. Through fault-injection testing, we could find the cause of faults by checking the average memory address of 3.28%, and we could present the point of fault occurrence with an average accuracy of 80%.