Skip to Main content Skip to Navigation
Journal articles

Mining Conjunctive Sequential Patterns

Abstract : In this paper 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 this context of frequent sequences, the notion of non-derivability is meaningless. Therefore, we extend our focus to the mining of conjunctions of sequences. Besides of being of practical importance, this class of patterns has some nice theoretical properties. Based on a new unexploited theoretical definition of equivalence classes for sequential patterns, we are able to extend the notion of a non-derivable itemset to the sequence domain. We present a new depth-first approach to mine non-derivable conjunctive sequential patterns and show its use in mining association rules for sequences. This approach is based on a well-known combinatorial theorem: the Möbius inversion. A performance study using both synthetic and real datasets illustrates the efficiency of our mining algorithm. These new introduced patterns have a high-potential for real-life applications, especially for network monitoring and biomedical fields with the ability to get sequential association rules with all the classical statistical metrics such as confidence, conviction, lift, etc.
Document type :
Journal articles
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Pascal Poncelet <>
Submitted on : Wednesday, March 20, 2019 - 3:40:04 PM
Last modification on : Sunday, August 15, 2021 - 3:05:59 AM
Long-term archiving on: : Friday, June 21, 2019 - 9:17:25 PM


Publisher files allowed on an open archive



Chedy Raïssi, Toon Calders, Pascal Poncelet. Mining Conjunctive Sequential Patterns. Data Mining and Knowledge Discovery, Springer, 2008, 17 (1), pp.77-93. ⟨10.1007/s10618-008-0108-z⟩. ⟨lirmm-00345401⟩



Record views


Files downloads