Mining segment-wise periodic patterns in time-related databases

摘要: Periodicity search, that is, search for cyclicity in time-related databases, is an interesting data mining problem. Most previous studies have been on finding full-cycle periodicity all the segments selected sequences of data, if a sequence periodic, points or period repeat. However, it often useful to mine segment-wise point-wise sets. In this study, we integrate cube and Apriori techniques regard fixed length show provides efficient structure convenient way interactive multiple-level periodicity.