Towards Bounding Sequential Patterns - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Towards Bounding Sequential Patterns

Chedy Raïssi
Jian Pei
  • Fonction : Auteur
  • PersonId : 906319

Résumé

Given a sequence database, can we have a non-trivial upper bound on the number of sequential patterns? The problem of bounding sequential patterns is very challenging in theory due to the combinatorial complexity of sequences, even given some inspiring results on bounding itemsets in frequent itemset mining. Moreover, the problem is highly meaningful in practice, since the upper bound can be used in many applications such as space allocation in building sequence data warehouses. In this paper, we tackle the problem of bounding sequential patterns by presenting, for the first time in the field of sequential pattern mining, strong combinatorial results on computing the number of possible sequential patterns that can be generated at a given length k. We introduce, as a case study, two novel techniques to estimate the number of candidate sequences. An extensive empirical study on both real data and synthetic data verifies the effectiveness of our methods.
Fichier principal
Vignette du fichier
p1379.pdf (695.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00623550 , version 1 (14-09-2011)

Identifiants

Citer

Chedy Raïssi, Jian Pei. Towards Bounding Sequential Patterns. 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD-2011, Aug 2011, San Diego, United States. ⟨10.1145/2020408.2020612⟩. ⟨inria-00623550⟩
143 Consultations
233 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More