Advertisement

FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns

  • Steffen Kempe
  • Jochen Hipp
  • Rudolf Kruse
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)

Abstract

Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contain labeled events with a temporal extension. Mining frequent temporal patterns from interval sequences proved to be a valuable tool for generating knowledge in the automotive business. In this paper we propose a new algorithm for mining frequent temporal patterns from interval sequences: FSMTree. FSMTree uses a prefix tree data structure to efficiently organize all finite state machines and therefore dramatically reduces execution times. We demonstrate the algorithm’s performance on field data from the automotive business.

Keywords

Temporal Pattern State Machine Temporal Interval Association Rule Support Evaluation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AGRAWAL, R., IMIELINSKI, T. and SWAMI, A. (1993): Mining association rules between sets of items in large databases. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data (ACM SIGMOD ’93). 207-216.Google Scholar
  2. AGRAWAL, R. and SRIKANT, R. (1995): Mining sequential patterns. In: Proc. of the 11th Int. Conf. on Data Engineering (ICDE ’95). 3-14.Google Scholar
  3. ALLEN, J. F. (1983): Maintaining knowledge about temporal intervals. Commun. ACM, 26(11):832-843.zbMATHCrossRefGoogle Scholar
  4. HÖPPNER, F. and KLAWONN, F. (2002): Finding informative rules in interval sequences. Intelligent Data Analysis, 6(3):237-255.zbMATHGoogle Scholar
  5. KAM, P.-S. and FU, A. W.-C. (2000): Discovering Temporal Patterns for Interval-Based Events. In: Data Warehousing and Knowledge Discovery, 2nd Int. Conf., DaWaK 2000. Springer, 317-326.Google Scholar
  6. KEMPE, S. and HIPP, J. (2006): Mining Sequences of Temporal Intervals. In: 10th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases Springer, Berlin-Heidelberg, 569-576.Google Scholar
  7. MANNILA, H., TOIVONNEN, H. and VERKAMO, I. (1997): Discovery of frequent episodes in event sequences. Data Mining and Knowl. Discovery, 1(3):259-289.CrossRefGoogle Scholar
  8. PAPAPETROU, P., KOLLIOS, G., SCLAROFF, S. and GUNOPULOS, D. (2005): Discover-ing frequent arrangements of temporal intervals. In: 5th IEEE Int. Conf. on Data Mining (ICDM ’05). 354-361.Google Scholar
  9. PEI, J., HAN, J., MORTAZAVI, B., PINTO, H., CHEN, Q., DAYAL, U. and HSU, M. (2001): Prefixspan: Mining sequential patterns by prefix-projected growth. In: Proc. of the 17th Int. Conf. on Data Engineering (ICDE ’01). 215-224.Google Scholar
  10. WINARKO, E. and RODDICK, J. F. (2005): Discovering Richer Temporal Association Rules from Interval-Based Data. In: Data Warehousing and Knowledge Discovery, 7th Int. Conf., DaWaK 2005. Springer, Berlin-Heidelberg, 315-325.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Steffen Kempe
    • 1
  • Jochen Hipp
    • 1
  • Rudolf Kruse
    • 2
  1. 1.Group ResearchDaimlerChrysler AGUlmGermany
  2. 2.Dept. of Knowledge Processing and Language EngineeringUniversity of MagdeburgMagdeburgGermany

Personalised recommendations