A Proposition for Sequence Mining Using Pattern Structures - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

A Proposition for Sequence Mining Using Pattern Structures

Victor Codocedo
Guillaume Bosc
Mehdi Kaytoue
Jean-François Boulicaut
Amedeo Napoli


In this article we present a novel approach to rare sequence mining using pattern structures. Particularly, we are interested in mining closed sequences, a type of maximal sub-element which allows providing a succinct description of the patterns in a sequence database. We present and describe a sequence pattern structure model in which rare closed subsequences can be easily encoded. We also propose a discussion and characterization of the search space of closed sequences and, through the notion of sequence alignments, provide an intuitive implementation of a similarity operator for the sequence pattern structure based on directed acyclic graphs. Finally, we provide an experimental evaluation of our approach in comparison with state-of-the-art closed sequence mining algorithms showing that our approach can largely outperform them when dealing with large regions of the search space.
Fichier principal
Vignette du fichier
ICFCA2017.pdf (857.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01549107 , version 1 (28-06-2017)



Victor Codocedo, Guillaume Bosc, Mehdi Kaytoue, Jean-François Boulicaut, Amedeo Napoli. A Proposition for Sequence Mining Using Pattern Structures. ICFCA 2017 - 14th International Conference on Formal Concept Analysis, Peggy Cellier and Sébastien Ferré, Jun 2017, Rennes, France. pp.106-121, ⟨10.1007/978-3-319-59271-8_7⟩. ⟨hal-01549107⟩
686 View
806 Download



Gmail Facebook X LinkedIn More