Towards Efficiently Mining Frequent Interval-Based Sequential Patterns in Time Series Databases

Author(s):  
Phan Thi Bao Tran ◽  
Vo Thi Ngoc Chau ◽  
Duong Tuan Anh
Author(s):  
Wynne Hsu ◽  
Mong Li Lee ◽  
Junmei Wang

In this chapter, we will first give the background and review existing works in time series mining. The background material will include commonly used similarity measures and techniques for dimension reduction and data discretization. Then we will examine techniques to discover periodic and sequential patterns. This will lay the groundwork for the subsequent three chapters on mining dense periodic patterns, incremental sequence mining, and mining progressive patterns.


2018 ◽  
Vol 10 (11) ◽  
pp. 4330 ◽  
Author(s):  
Xinglong Yuan ◽  
Wenbing Chang ◽  
Shenghan Zhou ◽  
Yang Cheng

Sequential pattern mining (SPM) is an effective and important method for analyzing time series. This paper proposed a SPM algorithm to mine fault sequential patterns in text data. Because the structure of text data is poor and there are many different forms of text expression for the same concept, the traditional SPM algorithm cannot be directly applied to text data. The proposed algorithm is designed to solve this problem. First, this study measured the similarity of fault text data and classified similar faults into one class. Next, this paper proposed a new text similarity measurement model based on the word embedding distance. Compared with the classic text similarity measurement method, this model can achieve good results in short text classification. Then, on the basis of fault classification, this paper proposed the SPM algorithm with an event window, which is a time soft constraint for obtaining a certain number of sequential patterns according to needs. Finally, this study used the fault text records of a certain aircraft as experimental data for mining fault sequential patterns. Experiment showed that this algorithm can effectively mine sequential patterns in text data. The proposed algorithm can be widely applied to text time series data in many fields such as industry, business, finance and so on.


Author(s):  
Xiaoqi Jiang ◽  
Tiantian Xu ◽  
Xiangjun Dong

Campus data analysis is becoming increasingly important in mining students’ behavior. The consumption data of college students is an important part of the campus data, which can reflect the students’ behavior to a great degree. A few methods have been used to analyze students’ consumption data, such as classification, association rules, clustering, decision trees, time series, etc. However, they do not use the method of sequential patterns mining, which results in some important information missing. Moreover, they only consider the occurring (positive) events but do not consider the nonoccurring (negative) events, which may lead to some important information missing. So this paper uses a positive and negative sequential patterns mining algorithm, called NegI-NSP, to analyze the consumption data of students. Moreover, we associate students’ consumption data with their academic grades by adding the students’ academic grades into sequences to analyze the relationship between the students’ academic grades and their consumptions. The experimental results show that the students’ academic performance has significant correlation with the habits of having breakfast regularly.


2016 ◽  
Vol 30 (8) ◽  
pp. 1486-1506 ◽  
Author(s):  
Norhakim Yusof ◽  
Raul Zurita-Milla ◽  
Menno-Jan Kraak ◽  
Bas Retsios

2021 ◽  
Vol 1 (2) ◽  
pp. 20-37
Author(s):  
Rajae KRIBII ◽  
Youssef FAKIR

In recent times, the urge to collect data and analyze it has grown. Time stamping a data set is an important part of the analysis and data mining as it can give information that is more useful. Different mining techniques have been designed for mining time-series data, sequential patterns for example seeks relationships between occurrences of sequential events and finds if there exist any specific order of the occurrences. Many Algorithms has been proposed to study this data type based on the apriori approach. In this paper we compare two basic sequential algorithms which are General Sequential algorithm (GSP) and Sequential PAttern Discovery using Equivalence classes (SPADE). These two algorithms are based on the Apriori algorithms. Experimental results have shown that SPADE consumes less time than GSP algorithm.


Author(s):  
Marcos Daniel Cano ◽  
Marilde Terezinha Prado Santos ◽  
Ana Maria H. de Avila ◽  
Luciana A. S. Romani ◽  
Agma J. M. Traina ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document