, Les perspectives associées à ce travail sont nombreuses, notamment pour intégrer le calcul des clos au long du processus et non en post-traitement comme effectué actuellement et pour défi-nir les opérateurs de fermeture dans le cas de motifs graduels flous et de séquences graduelles, rateurs nécessaires, et montrons l'intérêt de notre approche à travers diverses expérimentations
An alternative approach to discover gradual dependencies, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol.15, issue.5, pp.559-570, 2007. ,
Frequent closures as a concise representation for binary data mining, PADKK '00 : Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.62-73, 2000. ,
Fast extraction of gradual association rules : a heuristic based method, Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology (CSTST '08), pp.205-210, 2008. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00324473
Extraction efficace de règles graduelles, EGC'09, pp.199-204, 2009. ,
Mining frequent gradual itemsets from large databases, Proceedings of the International Conference Intelligent Data Analysis (IDA'09), 2009. ,
Formal Concept Analysis, 1999. ,
Association rules for expressing gradual dependencies, Proceedings of the International Conference PKDD'2002, pp.200-211, 2002. ,
Graank : Exploiting rank correlations for extracting gradual dependencies, Proc. of FQAS'09, 2009. ,
Measuring variation strength in gradual dependencies, Proceedings of the International Conference EUSFLAT, pp.337-344, 2007. ,
Discovering frequent closed itemsets for association rules, ICDT '99 : Proceedings of the 7th International Conference on Database Theory, pp.398-416, 1999. ,
URL : https://hal.archives-ouvertes.fr/hal-00467747
Closet : An efficient algorithm for mining frequent closed itemsets, Proceedings of the 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000. ,