Exploiting Efficient Parallelism for Mining Rules in Time Series Data (original) (raw)

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.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)
    Google Scholar
  2. Bay, S.D.: Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets. In: Proc. of 15th International Conference on Machine Learning, pp. 37–45 (1998)
    Google Scholar
  3. 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)
    Google Scholar
  4. 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)
    Chapter Google Scholar
  5. 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)
    Google Scholar
  6. Agrawal, R., Shafer, J.: Parallel Mining of Association Rules. IEEE Transactions on Knowledge and Data Engineering 6(8), 962–969 (1996)
    Article Google Scholar
  7. Agrawal, R.: Fast Algorithms for Mining Associations Rules. In: Proc. of 20th VLDB Conference, pp. 487–499 (1994)
    Google Scholar
  8. Park, J.S., Chen, M.S., Yu, P.S.: Efficient Parallel Data mining for Association Rules. In: Proc. of CIKM, pp. 31–36 (1995)
    Google Scholar
  9. Zaki, M.J.: Efficient Enumeration of Frequent Sequences. In: Proc. of Intl. Conf. on Information and Knowledge Management, pp. 68–75 (1998)
    Google Scholar
  10. 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)
    Google Scholar
  11. 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)
    Google Scholar
  12. Adamo, J.-M.: Data Mining for Association Rules and Sequential Patterns- Sequential and Parallel Algorithms. Springer, Heidelberg (2001)
    Book MATH Google Scholar
  13. 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)
    Chapter Google Scholar
  14. Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proc. of 11th ICDE Conf., pp. 3–14 (1995)
    Google Scholar
  15. 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)
    Google Scholar
  16. 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)
    Google Scholar
  17. 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)
    Google Scholar
  18. 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)
    Article Google Scholar
  19. 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)
    Chapter Google Scholar

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, University of New Brunswick, Fredericton, Canada
    Biplab Kumer Sarker
  2. Department of Computer and Systems Engineering, Kobe University, Japan
    Kuniaki Uehara
  3. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada
    Laurence T. Yang

Authors

  1. Biplab Kumer Sarker
  2. Kuniaki Uehara
  3. Laurence T. Yang

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada
    Laurence T. Yang
  2. School of Computer Science/Welsh eScience Centre, Cardiff University, UK
    Omer F. Rana
  3. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy
    Beniamino Di Martino
  4. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA
    Jack Dongarra

Rights and permissions

© 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

Keywords

Publish with us