CLIM : CLosed Inclusion dependency Mining in databases - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

CLIM : CLosed Inclusion dependency Mining in databases

Fabien de Marchi

Résumé

Declarative pattern mining implies to define common frameworks and atomic operators for different problems. In this paper, we consider INclusion Dependency (IND) mining which is a classical data mining problem, with many applications in databases and data analysis. We present a novel and quite surprising result: IND mining can be optimized by a closure operator, as it is done for support-based pattern mining. As a consequence, and through a data pre-processing, satisfied closed INDs can be mined with very few programming efforts, using closed itemset mining procedure as a basic operator.
Fichier non déposé

Dates et versions

hal-01354582 , version 1 (18-08-2016)

Identifiants

  • HAL Id : hal-01354582 , version 1

Citer

Fabien de Marchi. CLIM : CLosed Inclusion dependency Mining in databases. Data Mining Workshops (ICDMW), 11th International Conference on Data Mining, Dec 2011, Vancouver, Canada. pp.1098-1103. ⟨hal-01354582⟩
85 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More