On Transversal Hypergraph Enumeration in Mining Sequential Patterns

Abstract : The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this paper we first analyze the constraints of using transversal hypergraph enumeration in itemset mining, then propose the ordered pattern model for representing and mining sequences with respect to these constraints. We show that the problem of mining sequential patterns can be transformed to the problem of mining frequent ordered patterns, and therefore we propose an application of the Dualize and Advance algorithm, which is transversal hypergraph enumeration based, in mining sequential patterns.
Type de document :
Communication dans un congrès
IDEAS'07: 11th International Database Engineering & Applications Symposium, pp.303-307, 2007, 〈http://ideas.concordia.ca/ideas07/〉
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00275949
Contributeur : Haoyuan Li <>
Soumis le : vendredi 25 avril 2008 - 21:02:23
Dernière modification le : jeudi 24 mai 2018 - 15:59:23
Document(s) archivé(s) le : vendredi 28 mai 2010 - 17:47:20

Identifiants

  • HAL Id : lirmm-00275949, version 1

Collections

Citation

Haoyuan Li, Anne Laurent, Maguelonne Teisseire. On Transversal Hypergraph Enumeration in Mining Sequential Patterns. IDEAS'07: 11th International Database Engineering & Applications Symposium, pp.303-307, 2007, 〈http://ideas.concordia.ca/ideas07/〉. 〈lirmm-00275949〉

Partager

Métriques

Consultations de la notice

130

Téléchargements de fichiers

107