Abstract
Mining interesting rules from time series data has earned a lot of attention to the data mining community recently. It is quite useful to extract important patterns from time series data to understand how the current and the past values of patterns in the multivariate time series data are related to the future. These relations can basically be expressed as rules. Mining these interesting rules among patterns is time consuming and expensive in multi-stream data. Incorporating parallel processing techniques is helpful to solve the problem. In this paper, we present a parallel algorithm based on a lattice theoretic approach to find out the rules among patterns that sustain sequential nature in the multi-stream data of time series. The human motion data considered as multi-stream multidimensional data used as data set for this purpose is transformed into sequences of symbols of lower dimension due to its complex nature. Then the proposed algorithm is implemented on a Distributed Shared Memory (DSM) multiprocessors system. The experimental results justify the efficiency of finding rules from the sequences of the patterns for time series data by achieving significant speed up comparing with the previous reported algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berndt, D.J., Clifford, J.: Finding Patterns in Time Series: A Dynamic Programming Approach. In: Proc. of Advances in Knowledge Discovery and Data Mining, pp. 229–248 (1996)
Bay, S.D.: Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets. In: Proc. of 15th International Conference on Machine Learning, pp. 37–45 (1998)
Oates, T., Cohen, P.R.: Searching for Structure in Multiple Stream of Data. In: Proc. of 13th International Conference on Machine Learning, pp. 346–354 (1996)
Shimada, M., Uehara, K.: Discovery of correlation from multi-stream of human motion. In: Morishita, S., Arikawa, S. (eds.) DS 2000. LNCS (LNAI), vol. 1967, pp. 290–294. Springer, Heidelberg (2000)
Das, G., Lin, K., Mannila, H., Renganathan, G., Smyth, P.: Rule Discovery from Time Series. In: Proc. of Fourth International Conference on Knowledge Discovery and Data mining, pp. 16–22. AAAI Press, Menlo Park (1998)
Agrawal, R., Shafer, J.: Parallel Mining of Association Rules. IEEE Transactions on Knowledge and Data Engineering 6(8), 962–969 (1996)
Agrawal, R.: Fast Algorithms for Mining Associations Rules. In: Proc. of 20th VLDB Conference, pp. 487–499 (1994)
Park, J.S., Chen, M.S., Yu, P.S.: Efficient Parallel Data mining for Association Rules. In: Proc. of CIKM, pp. 31–36 (1995)
Zaki, M.J.: Efficient Enumeration of Frequent Sequences. In: Proc. of Intl. Conf. on Information and Knowledge Management, pp. 68–75 (1998)
Zaki, M.J.: Parallel Sequence Mining of Shared Memory Machine. In: Proc. of Workshop on Large-Scale Parallel KDD Systems, SIGKDD, pp. 161–189 (1999)
Rosenstein, M.T., Cohen, P.R.: Continuous Categories for a Mobile Robot. In: Proc. of 16th National Conference on Artificial Intelligence, pp. 634–640 (1999)
Adamo, J.-M.: Data Mining for Association Rules and Sequential Patterns- Sequential and Parallel Algorithms. Springer, Heidelberg (2001)
Sarker, B.K., Mori, T., Hirata, T., Uehara, K.: Parallel Algorithms for Mining Association Rules in Time Series Data. In: Guo, M. (ed.) ISPA 2003. LNCS, vol. 2745, pp. 273–284. Springer, Heidelberg (2003)
Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proc. of 11th ICDE Conf., pp. 3–14 (1995)
Agrawal, R., Srikant, R.: Mining Sequential Patterns: Generalization and Performance Improvements. In: Proc. of 5th Intl. Conf. on Extending Database Technology, pp. 3–14 (1996)
Sarker, B.K., Hirata, T., Uehara, K.: Parallel Mining of Associations Rules in Time. Series Multi-stream Data, Special issue in the Journal of Information, to be appeared in the (1) (2006)
Zhu, Y., Shasha, D.: StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time. In: Proc. of the 28th VLDB Conf., pp. 358–369 (2002)
Roddick, J.F., Spiliopoulou, M.: A Survey of Temporal Knowledge Discovery Paradigms and Methods. IEEE Transactions on Knowledge and Data Engineering 14(4), 750–767 (2002)
Honda, R., Konishi, O.: Temporal Rule Discovery for Time Series Satellite Images and Integration with RDB. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol. 2168, pp. 204–215. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sarker, B.K., Uehara, K., Yang, L.T. (2005). Exploiting Efficient Parallelism for Mining Rules in Time Series Data. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_95
Download citation
DOI: https://doi.org/10.1007/11557654_95
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29031-5
Online ISBN: 978-3-540-32079-1
eBook Packages: Computer ScienceComputer Science (R0)