R. Jorio, Les auteurs remercient Lisa Di Jorio pour leur avoir fourni les sources de son implémentation de recherche des motifs et règles graduels, 2009.

R. Agrawal and J. C. Shafer, Parallel mining of association rules, IEEE Trans. Knowl. Data Eng, vol.8, issue.6, pp.962-969, 1996.

R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proceedings of the 20th VLDB Conference, pp.487-499, 1994.

F. Berzal, J. Cubero, D. Sanchez, M. Vila, and J. M. Serrano, An alternative approach to discover gradual dependencies, Int. Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (IJUFKS), vol.15, issue.5, pp.559-570, 2007.

G. Buehrer, S. Parthasarathy, and Y. Chen, Adaptive parallel graph mining for cmp architectures, ICDM, pp.97-106, 2006.

D. Jorio, L. , A. Laurent, and M. Teisseire, Fast extraction of gradual association rules : A heuristic based method, IEEE/ACM Int. Conf. on Soft computing as Transdisciplinary Science and Technology, CSTST'08, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00324473

D. Jorio, L. , A. Laurent, and M. Teisseire, Mining frequent gradual itemsets from large databases, Int. Conf. on Intelligent Data Analysis, IDA'09, 2009.

C. Fiot, F. Masseglia, A. Laurent, and M. Teisseire, Gradual trends in fuzzy sequential patterns, Proc. of the Int. Conf. on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU), 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00273910

J. Han and M. Kamber, The Morgan Kaufmann Series in Data Management Systems, Data Mining : Concepts and Techniques, 2006.

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, Proc. of the International Conference on Management of Data, pp.1-12, 2000.

E. Hüllermeier, Association rules for expressing gradual dependencies, Proc. of the 6th European Conf. on Principles of Data Mining and Knowledge Discovery, PKDD'02, pp.200-211, 2002.

A. Laurent, M. Lesot, and M. Rifqi, Graank : Exploiting rank correlations for extracting gradual dependencies, Proc. of FQAS'09, 2009.

L. Liu, E. Li, Y. Zhang, and E. Z. Tang, Optimization of frequent itemset mining on multiple-core processor, VLDB '07 : Proceedings of the 33rd international conference on Very large data bases, pp.1275-1285, 2007.

C. Lucchese, S. Orlando, and R. Perego, Parallel mining of frequent closed patterns : Harnessing modern computer architectures, ICDM, pp.242-251, 2007.

N. Pasquier, Y. Yves, R. Bastide, L. Taouil, and . Lakhal, Efficient mining of association rules using closed itemset lattices, Information Systems, vol.24, pp.25-46, 1999.

S. S. Tatikonda and . Parthasarathy, Mining tree-structured data on multicore systems, VLDB '09 : Proceedings of the 35th international conference on Very large data bases, 2009.

T. Uno, Lcm ver. 3 : Collaboration of array, bitmap and prefix tree for frequent itemset mining, Proc. of the ACM SIGKDD Open Source Data Mining Workshop on Frequent Pattern Mining Implementations, pp.77-86, 2005.

X. Yan and J. Han, gspan : Graph-based substructure pattern mining, Proc. of the IEEE International Conference on Data Mining, p.721, 2002.

M. J. Zaki, Parallel sequence mining on shared-memory machines, Large-Scale Parallel Data Mining, pp.161-189, 1999.

M. J. Zaki, S. Parthasarathy, M. Ogihara, and E. W. Li, Parallel algorithms for discovery of association rules, Data Min. Knowl. Discov, vol.1, issue.4, pp.343-373, 1997.