Issue No. 03 - March (2004 vol. 16)
Walid G. Aref , IEEE
Ahmed K. Elmagarmid , IEEE
<p><b>Abstract</b>—Mining of periodic patterns in time-series databases is an interesting data mining problem. It can be envisioned as a tool for forecasting and prediction of the future behavior of time-series data. Incremental mining refers to the issue of maintaining the discovered patterns over time in the presence of more items being added into the database. Because of the mostly append only nature of updating time-series data, incremental mining would be very effective and efficient. Several algorithms for incremental mining of partial periodic patterns in time-series databases are proposed and are analyzed empirically. The new algorithms allow for online adaptation of the thresholds in order to produce interactive mining of partial periodic patterns. The storage overhead of the incremental online mining algorithms is analyzed. Results show that the storage overhead for storing the intermediate data structures pays off as the incremental online mining of partial periodic patterns proves to be significantly more efficient than the nonincremental nononline versions. Moreover, a new problem, termed merge mining, is introduced as a generalization of incremental mining. Merge mining can be defined as merging the discovered patterns of two or more databases that are mined independently of each other. An algorithm for merge mining of partial periodic patterns in time-series databases is proposed and analyzed.</p>
Data mining, time-series databases, incremental mining, online mining.
A. K. Elmagarmid, M. G. Elfeky and W. G. Aref, "Incremental, Online, and Merge Mining of Partial Periodic Patterns in Time-Series Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 332-342, 2004.