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

Prefixspan: Mining sequential patterns by prefix-projected growth, ICDE, pp.215-224, 2001. ,

Efficient substructure discovery from large semi-structured data, Proc. of the Second SIAM International Conference on Data Mining (SDM2002), pp.158-174, 2002. ,

An apriori-based algorithm for mining frequent substructures from graph data, pp.13-23, 2000. ,

Mining quantitative association rules in large relational tables, SIGMOD Conference, pp.1-12, 1996. ,

A statistical theory for quantitative association rules, J. Intell. Inf. Syst, vol.20, issue.3, pp.255-283, 2003. ,

Mining quantitative frequent itemsets using adaptive density-based subspace clustering, ICDM, pp.793-796, 2005. ,

Mining frequent gradual itemsets from large databases, Int. Conf. on Intelligent Data Analysis, IDA'09, 2009. ,

Efficient mining of association rules using closed itemset lattices, Information Systems, vol.24, pp.25-46, 1999. ,

, Fimi repository website, 2003.

Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets, 2004. ,

Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses, The 2010 International Conference on High Performance Computing & Simulation (HPCS 2010), 2010. ,

URL : https://hal.archives-ouvertes.fr/hal-00788879

A Generic and Parallel Pattern Mining Algorithm for Multi-Core Architectures, PhD dissertation, 2011. ,

URL : https://hal.archives-ouvertes.fr/tel-00680025

An output-polynomial time algorithm for mining frequent closed attribute trees, 15th International Conference on Inductive Logic Programming (ILP'05), 2005. ,

An alternative approach to discover gradual dependencies, Fuzziness and Knowledge-Based Systems (IJUFKS), vol.15, pp.559-570, 2007. ,

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. ,

Pgp-mc: Towards a multicore parallel approach for mining gradual patterns, DASFAA (1), pp.78-84, 2010. ,

URL : https://hal.archives-ouvertes.fr/hal-00788890

Mining closed gradual patterns, 10th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2010, ser. LNCS, vol.6113, pp.267-274, 2010. ,

URL : https://hal.archives-ouvertes.fr/lirmm-00504029

Graank: Exploiting rank correlations for extracting gradual dependencies, Proc. of FQAS'09, 2009. ,

The problem of m rankings, The annals of mathematical statistics, vol.10, issue.3, pp.275-287, 1939. ,

Dci closed: A fast and memory efficient algorithm to mine frequent closed itemsets, 2004. ,

An efficient algorithm for enumerating closed patterns in transaction databases, Discovery Science, pp.16-31, 2004. ,

Multiple tuple spaces in linda, pp.20-27, 1989. ,

What are fuzzy rules and how to use them, Fuzzy Sets and Systems, vol.84, pp.169-185, 1996. ,

Gradual inference rules in approximate reasoning, Information Sciences, vol.61, pp.103-122, 1992. ,

Gradual rules and the approximation of control laws, Theoretical aspects of fuzzy control, pp.147-181, 1995. ,

A new perspective on reasoning with fuzzy rules, International Journal of Intelligent Systems, vol.18, issue.5, pp.541-567, 2003. ,

URL : https://hal.archives-ouvertes.fr/hal-00442734

Discriminative Frequent Pattern Analysis for Effective Classification, International Conference on Data Engineering, pp.717-725, 2007. ,

, His research interests include research interests include data mining, database, parallel systems and information retrieval, 2011.

, at the LIG lab. As a member of the HADAS research group, he works on data mining, focusing on pattern mining. He is interested in parallelism in order to make scalable parallel pattern mining algorithms capable of exploiting multicore processors. He is also interested in mining structured data such as trees or graphs

, at the LIRMM lab. As a member of the TATOO research group, she works on data mining, sequential pattern mining, tree mining, both for trends and exceptions detections and is particularly interested in the study of the use of fuzzy logic to provide more valuable results, while remaining scalable. Anne Laurent teaches in the Computer Science, vol.2

, He is interested in parallel and generic pattern mining algorithms. He is now working on constraint programming for data mining at the Dept. of Computer Science of, Benjamin Negrevergne received his Ph.D. in 2011 from the University of Grenoble in France

, He is interested in interactive systems for data mining and pattern analysis methods. He obtained his master degree from the University of Grenoble in the field of Artificial Intelligence and the Web, Behrooz Omidvar-Tehrani is currently a Ph.D. candidate in LIG laboratory

, she was Senior Scientist at Yahoo! Research and worked on revisiting relevance models and top-k processing algorithms on Delicious, Yahoo! Personals and Flickr. Before that, she spent 7 years at at&t Labs in NJ, working on XML query optimization and XML full-text search, Sihem is a member of the VLDB Endowment and serves on the editorial boards of ACM TODS, the VLDB Journal and the Information Systems Journal. She is track chair of SIGIR 2013 and of PVLDB 2013. She will serve as PC chair of EDBT, 2006.

, Email: Alexandre.Termier@imag.fr