Constraint Based Periodicity Mining in Time Series Databases
The search for the periodicity in time-series database has a number of application, is an interesting data mining problem. In real world dataset are mostly noisy and rarely a perfect periodicity, this problem is not trivial. Periodicity is very common practice in time series mining algorithms, since it is more likely trying to discover periodicity signal with no time limit. The authors propose an algorithm uses FP-tree for finding symbol, partial and full periodicity in time series.