Discovering Unbounded Episodes in Sequential Data

  • Gemma Casas-Garriga
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2838)

Abstract

One basic goal in the analysis of time-series data is to find frequent interesting episodes, i.e, collections of events occurring frequently together in the input sequence. Most widely-known work decide the interestingness of an episode from a fixed user-specified window width or interval, that bounds the length of the subsequent sequential association rules. We present in this paper, a more intuitive definition that allows, in turn, interesting episodes to grow during the mining without any user-specified help. A convenient algorithm to efficiently discover the proposed unbounded episodes is also implemented. Experimental results confirm that our approach results useful and advantageous.

References

  1. 1.
    Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, I.: Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining (1996)Google Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proc. of the Int. Conf. on Data Engineering (1995)Google Scholar
  3. 3.
    Baixeries, J., Casas-Garriga, G., Balcázar, J.L.: A Best First Strategy for Finding Frequent Sets. In: Extraction et gestion des connaissances (EGC 2002), pp. 100–106 (2002)Google Scholar
  4. 4.
    Brin, S., Motwani, R., Ullman, J., Tsur, S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. In: Int. Conf. Management of Data (1997)Google Scholar
  5. 5.
    Hiaro, M., Inenaga, S., Shinohara, A., Takeda, M., Arikawa, S.: A Practical Algorithm to Find the Best Episode Patterns. In: Int. Conf. on Discovery Science, pp. 235–440 (2001)Google Scholar
  6. 6.
    Mannila, H., Toivonen, H., Verkamo, I.: Discovery of frequent episodes in event sequences. In: Proc. Int. Conf. on Knowledge Discovery and Data Mining (1995)Google Scholar
  7. 7.
    Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations And Performance Improvements. In: Proc. 5th Int. Conf. Extending Database Technology (1996)Google Scholar
  8. 8.
    Zaki, M.J.: Sequence Mining in Categorical Domains: Incorporating Constrains. In: Proc. Int. Conf. on Information and knowledge management, pp. 422–429 (2000)Google Scholar
  9. 9.
    Data Analysis Challenge, http://centria.di.fct.unl.pt/ida01/
  10. 10.
    Geneva University Hospital and University of Geneva, Switzerland. ExPASy Molecular Biology Server, http://www.expasy.ch/

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Gemma Casas-Garriga
    • 1
  1. 1.Departament de Llenguatges i Sistemes InformàticsUniversitat Politècnica de CatalunyaBarcelona

Personalised recommendations