On Transversal Hypergraph Enumeration in Mining Sequential Patterns - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2007

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.
Fichier principal
Vignette du fichier
ideas07li.pdf (83.2 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00275949 , version 1 (25-04-2008)

Identifiers

  • HAL Id : lirmm-00275949 , version 1

Cite

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. ⟨lirmm-00275949⟩
107 View
203 Download

Share

More