A framework for frequent sequence mining under generalized regular expression constraints

Abstract : This paper is an extension of the RE-Hackle algorithm for mining sequential patterns that satisfy regular expression constraints.
Type de document :
Communication dans un congrès
2nd International Workshop on Knowledge discovery in inductive databases KDID'03 co-located with ECML-PKDD 2003, Sep 2003, Cavtat-Dubrovnik, Croatia. pp.2-16, 2003
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01593713
Contributeur : Équipe Gestionnaire Des Publications Si Liris <>
Soumis le : mardi 26 septembre 2017 - 15:54:12
Dernière modification le : mercredi 31 octobre 2018 - 12:24:07

Identifiants

  • HAL Id : hal-01593713, version 1

Citation

Hunor Albert-Lorincz, Jean-François Boulicaut. A framework for frequent sequence mining under generalized regular expression constraints. 2nd International Workshop on Knowledge discovery in inductive databases KDID'03 co-located with ECML-PKDD 2003, Sep 2003, Cavtat-Dubrovnik, Croatia. pp.2-16, 2003. 〈hal-01593713〉

Partager

Métriques

Consultations de la notice

104