Department of Computer Science and Engineering, National Sun Yat-Sen University,Kaohsiung, Taiwan Republic of China.

---

Abstract—Periodic pattern mining in time series database plays an important part in data mining. However, most existing algorithms consider only the count of each item, but do not consider about the value of each item. To consider the value of each item on periodic pattern mining in time series databases, Chanda et al. proposed an algorithm called WPPM. In their algorithm, they construct the suffix trie to store the candidate pattern at first. However, the suffix trie would use too much storage space. In order to decrease the processing time for constructing the data structure, in this paper, we propose two data structures to store the candidates. The first data structure is Weighted Paired Matrix. After scanning the database, we will transform the database into the matrix type, and it is used for the second data structures. Therefore, our algorithm not only can decrease the usage of the memory space, but also the processing time. Because we do not need to use so much time to construct so many nodes and edges. Moreover, wealso consider the case of incremental mining for the increase of the data length. From the performance study, we show that our proposed algorithm based on the Weighted Direction Graphis more efficient than the WPPMalgorithm.

Index Terms—Flexible patterns, periodic Patterns, time series database, weighted direction graph,weighted patterns.

[PDF]

Cite: Ye-In Chang, Cheng-An Fu, Jia-Zhen Que, "Mining Weighted Periodic Patterns by a Weighted Direction Graph Based Approach for Time-Series Databases," Journal of Software vol. 16, no. 6, pp. 267-284, 2021.

Copyright © 2021 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0)