Modeling and Mining Optimal Patterns using Dynamic CSP - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Modeling and Mining Optimal Patterns using Dynamic CSP

Résumé

—We introduce the notion of Optimal Patterns (OPs), defined as the best patterns according to a given user preference, and show that OPs encompass many data mining problems. Then, we propose a generic method based on a Dynamic Constraint Satisfaction Problem to mine OPs, and we show that any OP is characterized by a basic constraint and a set of constraints to be dynamically added. Finally, we perform an experimental study comparing our approach vs ad hoc methods on several types of OPs.
Fichier principal
Vignette du fichier
Modeling_and_Mining_Optimal_Patterns_usi.pdf (675.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01247156 , version 1 (21-12-2015)

Identifiants

  • HAL Id : hal-01247156 , version 1

Citer

Willy Ugarte, Patrice Boizumault, Bruno Crémilleux, Samir Loudni. Modeling and Mining Optimal Patterns using Dynamic CSP. 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI 2015), Nov 2015, Vietri-sul-mare, Italy. ⟨hal-01247156⟩
163 Consultations
229 Téléchargements

Partager

Gmail Facebook X LinkedIn More