An Algorithm of Discovering Approximate Periodicity Based on Self-Organizing Map for Temporal Data

This paper discusses an algorithm of discovering approximate periodicity for temporal data based on self- organizing map (SOM). First, an approximate periodic pattern based on the temporal type data is given. Then, some concepts of approximate precision and approximate periodic pattern mantle are introduced, where their relative properties are studied. Finally, an algorithm based on SOM to find approximate periodic pattern is proposed. Experiment results show that the proposed algorithm is efficient for finding out approximate periodicity for irregularity data.

[1]  Teuvo Kohonen,et al.  The self-organizing map , 1990 .

[2]  Jiawei Han,et al.  Efficient mining of partial periodic patterns in time series database , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[3]  Markus Peura,et al.  The Self-Organizing Map of Trees , 1998, Neural Processing Letters.

[4]  Philip S. Yu,et al.  Mining Asynchronous Periodic Patterns in Time Series Data , 2003, IEEE Trans. Knowl. Data Eng..

[5]  Cao Jun-kuo.  Application of the Kohonen Neural Network to Tobacco Classification , 2004 .

[6]  Sridhar Ramaswamy,et al.  Cyclic association rules , 1998, Proceedings 14th International Conference on Data Engineering.