Mining Multi-Relational Gradual Patterns

Abstract : Gradual patterns highlight covariations of attributes of the form " The more/less X, the more/less Y ". Their usefulness in several applications has recently stimulated the synthesis of several algorithms for their automated discovery from large datasets. However, existing techniques require all the interesting data to be in a single database relation or table. This paper extends the notion of gradual pattern to the case in which the co-variations are possibly expressed between attributes of different database relations. The interestingness measure for this class of " relational gradual patterns " is defined on the basis of both Kendall's τ and gradual supports. Moreover, this paper proposes two algorithms, named τ RGP Miner and gRGP Miner, for the discovery of relational gradual rules. Three pruning strategies to reduce the search space are proposed. The efficiency of the algorithms is empirically validated, and the usefulness of relational gradual patterns is proved on some real-world databases.
Type de document :
Communication dans un congrès
International Conference on Data Mining, Apr 2015, Vancouver, Canada. 2015, 〈10.1137/1.9781611974010.95〉
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger
Contributeur : Dino Ienco <>
Soumis le : lundi 7 décembre 2015 - 15:00:52
Dernière modification le : jeudi 24 mai 2018 - 15:59:25
Document(s) archivé(s) le : mardi 8 mars 2016 - 14:02:03


Fichiers produits par l'(les) auteur(s)



Nhathai Phan, Dino Ienco, Donato Malerba, Pascal Poncelet, Maguelonne Teisseire. Mining Multi-Relational Gradual Patterns. International Conference on Data Mining, Apr 2015, Vancouver, Canada. 2015, 〈10.1137/1.9781611974010.95〉. 〈lirmm-01239187〉



Consultations de la notice


Téléchargements de fichiers