Efficient Mining of Dense Periodic Patterns in Time Series
| dc.contributor.author | SHENG, Chang | en_US |
| dc.contributor.author | HSU, Wynne | en_US |
| dc.contributor.author | LEE, Mong Li | en_US |
| dc.date.accessioned | 2005-11-10T03:25:55Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:02Z | |
| dc.date.available | 2005-11-10T03:25:55Z | en_US |
| dc.date.available | 2017-01-23T07:00:02Z | |
| dc.date.issued | 2005-10-31 | en_US |
| dc.description.abstract | Existing techniques to mine periodic patterns in time series data are focused on discovering full-cycle periodic patterns from an entire time series. However, many useful partial periodic patterns are hidden in long and complex time series data. In this paper, we aim to discover the partial periodicity in local segments of the time series data. We introduce the notion of character density to partition the time series into variable-length fragments and to determine the lower bound of each character's period. We propose a novel algorithm, called DPMiner, to .nd the dense periodic patterns in time series data. The algorithm makes use of an Apriori-like property to prune the search space. Experimental results on both synthetic and real-life datasets demonstrate that the proposed algorithm is effective and ef.cient to reveal interesting dense periodic patterns. | en_US |
| dc.format.extent | 570927 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1859 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TR20/05 | en_US |
| dc.title | Efficient Mining of Dense Periodic Patterns in Time Series | en_US |
| dc.type | Technical Report | en_US |