Mining Relevant Sequence Patterns with CP-Based Framework - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Mining Relevant Sequence Patterns with CP-Based Framework

Résumé

—Sequential pattern mining under various constraints is a challenging data mining task. The paper provides a generic framework based on constraint programming to discover sequence patterns defined by constraints on local patterns (e.g., gap, regular expressions) or constraints on patterns involving combination of local patterns such as relevant subgroups and top-k patterns. This framework enables the user to mine in a declarative way both kinds of patterns. The solving step is done by exploiting the machinery of Constraint Programming. For complex patterns involving combination of local patterns, we improve the mining step by using dynamic CSP. Finally, we present two case studies in biomedical information extraction and stylistic analysis in linguistics.
Fichier principal
Vignette du fichier
master-ictai.pdf (675.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01628142 , version 1 (02-11-2017)

Identifiants

Citer

Amina Kemmar, Willy Ugarte, Samir Loudni, Thierry Charnois, Yahia Lebbah, et al.. Mining Relevant Sequence Patterns with CP-Based Framework. 26th {IEEE} International Conference on Tools with Artificial Intelligence, 2014, Limassol, Cyprus. pp.552 - 559, ⟨10.1109/ICTAI.2014.89⟩. ⟨hal-01628142⟩
96 Consultations
117 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More