Constraint Programming for Mining n-ary Patterns - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Constraint Programming for Mining n-ary Patterns

Résumé

The aim of this paper is to model and mine patterns combining several local patterns (n-ary patterns). First, the user expresses his/her query under constraints involving n-ary patterns. Second, a constraint solver generates the correct and complete set of solutions. This approach enables to model in a flexible way sets of constraints combining several local patterns and it leads to discover patterns of higher level. Experiments show the feasibility and the interest of our approach.
Fichier principal
Vignette du fichier
ACTI-KHIARI-2010-3.pdf (7.97 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01016652 , version 1 (30-06-2014)

Identifiants

  • HAL Id : hal-01016652 , version 1

Citer

Medhi Khiari, Patrice Boizumault, Bruno Crémilleux. Constraint Programming for Mining n-ary Patterns. Int. Conference on Principles and Practice of Constraint Programming (CP'10), Sep 2010, St Andrews, Scotland, France. pp.552-­567. ⟨hal-01016652⟩
92 Consultations
112 Téléchargements

Partager

Gmail Facebook X LinkedIn More