Mining Conjunctive Sequential Patterns

  • Chedy Raïssi
  • Toon Calders
  • Pascal Poncelet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5211)


In this paper we study the discovery of frequent sequences and we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative example: in the context of frequent sequences, the notion of non-derivability is meaningless.

This negative result motivated us to look at a slightly different problem: the mining of conjunctions of sequential patterns. This extended class of patterns turns out to have much nicer mathematical properties. For example, for this class of patterns we are able to extend the notion of non-derivable itemsets in a non-trivial way, based on a new unexploited theoretical definition of equivalence classes for sequential patterns. As a side-effect of considering conjunctions of sequences as the pattern type, we can easily form association rules between sequences. We believe that building a theoretical framework and an efficient approach for sequence association rules extraction problem is the first step toward the generalization of association rules to all complex and ordered patterns.


  1. 1.
    Raïssi, C., Calders, T., Poncelet, P.: Mining conjunctive sequential patterns. Data Mining and Knowledge Discovery 17(1), 77–93 (August 2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Chedy Raïssi
    • 1
    • 3
  • Toon Calders
    • 2
  • Pascal Poncelet
    • 3
  1. 1.LIRMMUniversity of MontpellierFrance
  2. 2.Eindhoven University of TechnologyNetherlands
  3. 3.LGI2P, Ecole des Mines d’AlèsFrance

Personalised recommendations