Prof. Jean-François Boulicaut Université de Lyon INSA Lyon, LIRIS CNRS UMR 5205 Bâtiment Blaise Pascal F-69621 Villeurbanne cedex, France Phone: +33 (0) 4 72 43 89 05 Fax: +33 (0) 4 72 43 87 13 Jean-Francois.Boulicaut at insa-lyon dot fr

Research   Teaching   Other activities   Publications

Research interests

• Many years ago ... Logic programming and deductive databases, database reverse engineering

• Starting in 1998, Data mining and Knowledge Discovery in Databases, more precisely inductive querying techniques to support unsupervized knowledge discovery (clustering, co-clustering, association rule mining, sequential pattern mining) with targeted applications to in silico biology.

Some more or less recent news  

•    INSA Lyon hosted the 8th International Symposium Intelligent Data Analysis (IDA 2009) in September 2009. The poster of the conference is there. Proceedings published by Springer are also available online (LNCS 5772).
•   Ieva Mitasiunaité's Ph.D was defended on May 19, 2009. It is entitled Mining string data under similarity and soft-frequency constraints: Application to promoter sequence analysis.
• I served as PC chair (with M. Berthold) of the 11th International Conference on Discovery Science DS'08. We edited the proceedings with T. Horvath  (Springer LNAI 5255). An erratum for the front matter of these proceedings is available here.
• Starting on October 2006, the "Data Mining and Inductive Databases" group within LIRIS has merged with two smaller groups working on artificial life, bio-inspired computer science and systems biology. It gives the Modeling and Knowledge Discovery team called TURING. See here for its first annual activity report. A survey of our scientific results in the data mining research area is given here (introductory text in French + list of publications).
• The IQ IST-FET project was a follow-up of the cInQ IST-FET EU funded project. It has started on September 1, 2005 and it has been completed on August 31, 2008. It has concerned further basic research on inductive databases given targeted applications in bioinformatics. The consortium was made of the Institute Jozef Stefan (Slovenia, coordinator), Katholieke Universiteit Leuven (Belgium), INSA Lyon (France), University of Wales Aberysthwyth (United Kingdom), University of Helsinki HIIT (Finland),  and  University of Antwerp (Belgium). A book edited by S. Dzeroski and B. Goethals will contain invited chapters about the state-of-the-art in the field of inductive databases and constraint-based data mining.
• The cInQ IST-FET project started in May 2001 and it was completed on April 2004. The cInQ consortium has organized a workshop by invitation only to mark the end of this IST-2000-26469 European project. At the workshop, the latest results in inductive databases, inductive querying and constraint based mining have been presented and future directions have been discussed. The Springer LNCS Volume 3848 is available (March 2006). It contains chapters from its invited participants.
• The book which contains extended contributions to Dagstuhl Seminar 04161 on Detecting Local Patterns, April 12-16, 2004 is available (see Springer LNAI 3539)
• The ECML PKDD 2004 conference (15th European Conference on Machine Learning and the 8th European conferences on Principles and practice of Knowledge Discovery in Databases) has attracted 581 submissions. 105 contributions  have been accepted as full papers (acceptance rate of 15%) and 19 other contributions have been selected as posters (and short papers to be included in the Proc.). Details about the exciting program of the conference are given on its WWW site ECML/PKDD 2004. From September 20 to September 24, the conference has attracted around 400 researchers in the heart of Pisa historical center. Here, you can see the co-chairs preparing the community meeting.
• The book in French "Informatique pour l'analyse du transcriptome" is available (Hermes Science Publishing).

Main ongoing projects

• ANR MDCO Bingo2 ("Knowledge Discovery For and By Inductive Queries in post-genomic applications", National Project 2008-2010) funded by ANR about inductive querying techniques in cooperation with University of Caen (coordinator: Bruno Crémilleux), University of Saint-Etienne (contact: François Jacquenet), and Centre de Génétique Moléculaire et Cellulaire (contact: Olivier Gandrillon). This project is a follow-up of ACI Masse de Données Bingo (2004-2007).
• BSMC (French working group on systems biology) which is now part of IXXI (Institut Rhône-Alpin des Systèmes Complexes).

Former projects

• IQ IST-FET FP6-516169 (Inductive Queries for Mining Patterns and Models, 2005-2008) is funded by the Future and Emergent Technologies arm of the IST programme FET-Open scheme. This consortium is made of the Institute Jozef Stefan (Slovenia, coordinator: Saso Dzeroski), Katholieke Universiteit Leuven (Belgium, contact: Luc de Raedt), INSA Lyon (France,  contact: Jean-François Boulicaut), University of Wales Aberysthwyth (United Kingdom, contact: Ross King), University of Helsinki HIIT (Finland, contact: Heikki Mannila),  and  University of Antwerp (Belgium, contact: Bart Goethals).
• cInQ, the project IST-2000-26469 (consortium on knowledge discovery by Inductive Queries, 2001-2004)) has been funded by the Future and Emergent Technologies arm of the IST programme FET-Open scheme. This consortium was made of the Universita degli Studi di Torino (Italy, contact Rosa Meo), the Politecnico di Milano (Italy, contact Pier-Luca Lanzi and Stefano Ceri), the Albert-Ludwigs Universitaet Freiburg (Germany, contact Luc de Raedt), the Nokia Research Center in Helsinki (Finland, contact Mika Klemettinen and Heikki Mannila), the Institute Jozef Stefan (Slovenia, contact Saso Dzeroski) and INSA Lyon (France, coordinator: Jean-François Boulicaut). This project has been completed on April 2004, 3Oth.
• ACI Masse de Données Bingo (National Project 2004-2007 has been funded by the French government, ACI MD 46) about inductive databases for gene expression data analysis in cooperation with University of Caen (coordinator Bruno Crémilleux), University of Saint-Etienne (François Jacquenet), and Centre de Génétique Moléculaire et Cellulaire (Olivier Gandrillon). This project has been completed on October 26, 2007.
• We have been a member of the European Knowledge Discovery Network of Excellence KDNet (IST-2001-33086) and associate node of the Network of Excellence in Inductive Logic Programming ILP2Net
• AS CNRS-STIC 2002 GaFoDonnées (in French)
• AS CNRS-STIC 2003/2004 DiscoChallenge (in French)

Current students:  Loïc Cerf (Ph.D. student since 02/2007), Thi Kim Ngan Nguyen (Ph.D. student since 09/2008)

Ongoing collaborations: Centre de Génétique Moléculaire et Cellulaire (Olivier Gandrillon), University of New Caledonia (Nazha Selmaoui)

Former students: Hunor Albert-Lorincz (Ms.S 09/2002, Ph.D. 07/2007), Jérémy Besson (Ph. D. 11/2005), Sylvain Blachon (Ph.D. 06/2007), Artur Bykowski (Ms.S 07/1999, Ph. D. 10/2002),  Clément Fauré (Ph.D. 11/2007), Dominique Gay (Ph.D. 11/2009), Baptiste Jeudy (Ph.D. 12/2002), Marion Leleu (Ph. D. 01/2004), Cyrille Masson (Ph. D. 07/2005), Pierre-Nicolas Mougel (M2, 09/2009), Ieva Mitasunaite (Ms.S. 2004/2005, Ph.D. 05/2009), Jean-Marc Petit (Ph. D. 11/1996), Ruggero G. Pensa (Ph. D. 11/2006).

Experience

• Ph. D. in 1992 (INSA Lyon), Habilitation in 2001 (HDR University Lyon 1 and INSA Lyon).
• Lecturer (ASS) in Computer Science from 1984 to 1992 (Ecole Centrale de Lyon)
• Associate Professor (MCU) in Computer Science (INSA Lyon - First  Cycle / LIRIS) from 1992 to 2006
• Invited researcher at the Department of Computer Science of  the University of Helsinki in 97/98 (sabbatical leave from INSA Lyon)
• Currently, Professor (PR1C) in Computer Science at INSA Lyon (Computer Science department/LIRIS)

Teaching

• Programming
• Compiler Construction
• Logic Programming and Prolog
• Databases
• Data Mining
• Tutorial Query languages for Knowledge Discovery in Databases at PKDD'99, September 1999
• Tutorial Inductive Databases and Constraint-Based Mining (with Luc De Raedt) at ECML/PKDD 2002, August 2002. A shorter version of this tutorial has been given in French at EGC 2003.
• Tutorial Constraint-based mining: a major step towards inductive databases at IDA 2003, August 2003.

Other scientific activities

Elected member of the Scientific Committee for INSA Lyon (2007-2010)

Member of the UMR 5205 executive committee.

Leader of the TURING research group (formerly, leader of the Data Mining and Inductive Database group at LIRIS, see here for an introductory text in French  and the list of publications of this group). Here a photo of most of the members in december 2009.

Selected PC Memberships

• ICFCA'10, IDA'10 (senior PC member), SIAM SDM'10

• SIAM SDM'09, ACM SIGKDD'09, IDA 2009 (Conference Chair), ECML/PKDD 2009, DS'09, ACM CIKM'09, DDDM'09 (Workshop co-chair), IEEE ICDM'09

• SIAM SDM'08, PRICAI'08, ECML/PKDD'08 (PC Area Chair), DS'08 (PC co-Chair), ACM CIKM'08, IEEE ICDM'08 (Panel Chair)

• SIAM SDM'07, PAKDD'07, ACM SIGKDD'07, ECML/PKDD'07, IDA'07, DS'07

• SIAM SDM'06, KDID'06, ECML/PKDD'06, IEEE ICDM'06

• SIAM SDM'05, ACM SIGKDD'05, BIOKDD'05, ICML'05, IDA'05, ECML/PKDD'05, KDID'05 (PC co-Chair), IEEE ICDM'05

• ECML/PKDD'04 (PC co-Chair), KDID'04, IEEE ICDM'04 (PC Vice Chair)

• KDID'03 (PC co-Chair), PKDD'03

• ECAI'02 (Tutorial Chair), ECML/PKDD 2002 (Workshop co-Chair), KDID'02

• PKDD'01

• PKDD'00

I have been also involved in many other PCs for conferences (e.g., DaWaK, ILP), international workshops (e.g., MRDM), and French-speaking annual events (e.g., JFPLC, BDA, CAp, EGC, RFIA).

Steering Committees

• Member of the IDA council (Intelligent Data Analysis symposium steering committee) since September 2007

• Member of the Discovery Science Steering committee (DS) since October 2008

• Member of the ECML PKDD steering committee from September 2004 to September 2007

Dagstuhl Seminar Organization with K. Morik (Univ. Dortmund, D) and A. Siebes (Univ. Utrecht, NL) of Dagstuhl Seminar 04161 on Detecting Local Patterns, April 12-16, 2004. See here for a photo.

Member of the Editorial Boards of Data Mining and Knowledge Discovery and Bioinformatics and Biology Insights

External reviewer for Ph. D thesis: Mika Klemettinen (Helsinki, FIN, 1999), Anne Laurent (Paris, F, 2002), Sandra Berasaluce (Nancy, F, 2002), Francesco Bonchi (Pisa, I, 2003), Cheikh Talibouya Diop (Tours-Blois, F, 2003), Arno Knobbe (Utrecht, NL, 2004), Miriam Baglioni (Pisa, I, 2005), Taneli Mielikainen (Helsinki, FIN, 2005), Sau Dan Lee (Freiburg, D, 2005), Edi Winarko (Flinders University, Adelaide, Australia, 2007), Mohamed Elati (Paris 13, F, 2007), Ariana Gallo (Torino, Italy, 2008), Chedy Raissi (Montpellier, F, 2008), Stéphanie Jacquemont (Saint-Etienne, F, 2008), Julien Briche (Toulon, F, 2009), Andrea Romei (Pisa, I, 2009).

Examinator for Ph.D. or Habilitations: Kitsana Wayamai (Ph.D., Clermont-Ferrand, F, 1999), Arnaud Ragel (Ph.D., Caen, F, 1999),  Olivier Pivert (Habilitation, Lannion, F, 2000), Thomas Daurel (Ph.D., Lyon, F, 2003), Bruno Crémilleux (Habilitation, Caen, F, 2004), Nicolas Meger (Ph.D., Lyon, F, 2004), Christophe Rigotti (Habilitation, Lyon, F, 2004), Yoann Padioleau (Ph.D., Rennes, F, 2005), Yoan Renaud (Ph.D., Clermont-Ferrand, F, 2008), Yolanda Sanchez-Dehesa Fernandez (Ph.D., Lyon, 2009), Adriana Prado (Ph.D., Antwerp, B, 2009), Jilles Vreeken (Ph.D., Utrecht, NL, 2009)

Invited talks

• French-speaking conference on Fuzzy Logic and its applications LFA'00

• Third International Conference on Human-System Learning CAPS'3, 2000

• Workshop Database support for KDD co-located with ECML-PKDD'01, Freiburg, Germany, September 2001 (see here).

• International workshop DTDM'02 co-located with EDBT'02 (slides available here), Praha, Czech Republic, March 2002.

• Panelist for the Innovative Projects for Intelligent Systems in the New Century panel at ISMIS 2002, Lyon, France, June 2002

• French-speaking Conference on Machine Learning CAp 2004, Montpellier, France, June 2004.

• French Speaking Conference on Constraint Programming JFPC'05, Lens, France, June 2005.

• Inductive databases: new concepts for data-driven jnowledge discovery processes at the 7th International Baltic Conference on Databases and Information Systems DB&IS 2006,Vilnius, Lithuania, July 2006.

• Don't be afraid of too many patterns, Dagstuhl Seminar 07181 Parallel Universes and Local Patterns, Wadern, Germany, May 2007.

• Actionability and formal concepts: a data mining perspective, ICFCA'08, February 2008 (slides here).

• Invited talk at the 1st First International Workshop on Semantic Aspects in Data Mining (SADM'08) in conjunction with the 2008 IEEE International Conference on Data Mining (ICDM 2008), December 2008. Slides here.

Member of ACM (Association for Computing Machinery) and its Special Interest Group SIGKDD

Publications (See also DBLP server  or Google Scholar, Springerlink)

Editorial activities

1. Niall M. Adams, Céline Robardet, Arno Siebes, Jean-Francois  Boulicaut (Eds.) Advances in Intelligent Data Analysis VIII - Proc. 8th International Symposium on Intelligent Data Analysis IDA'09, Lyon, France, Springer LNAI 5772, 2009.
2. Jean-Francois Boulicaut, Michael R. Berthold, Tamas Horvath (Eds). Proc. 11th International Conference Discovery Science DS'08, Springer LNAI 5255, 2008.
3. Francesco Bonchi, Jean-Francois Boulicaut (Eds.) Knowledge Discovery in Inductive Databases KDID'05 Revised Selected and Invited Papers, Springer LNCS 3933, 2006
4. Jean-Francois  Boulicaut, Luc De Raedt, Heikki Mannila (Eds.) Constraint-based Mining and Inductive Databases, Hinterzarten Workshop Revised Selected Papers. Springer LNCS 3848, 2005.
5. Francesco Bonchi, Jean-Francois Boulicaut (Eds.) Proc. 4th International Workshop on Knowledge Discovery in Inductive Databases KDID'05 co-located with ECML-PKDD 2005, Porto (Portugal), October 20, 2005.
6. Katharina Morik, Jean-Francois  Boulicaut, Arno Siebes (Eds.) Local Pattern Detection: International Seminar, Dagstuhl Castle, Germany, April 12-16, 2004, Revised Selected Papers, Springer LNAI 3539, 2005.
7. Jean-Francois Boulicaut and Bruno Crémilleux (coordinateurs). Extraction de motifs dans des bases de données. RSTI ISI  9(3/4), Hermes-Lavoisier, 2004 (see here for a long and informative editorial in French).
8. Jean-Francois Boulicaut, Floriana Esposito, Fosca Giannotti, and Dino Pedreschi (Eds.). Proc. 8th European conferences on Principles and practice of Knowledge Discovery in Databases PKDD 2004,  Springer LNAI 3202. September 2004.
9. Jean-Francois Boulicaut, Floriana Esposito, Fosca Giannotti, and Dino Pedreschi (Eds.). Proc. 15th European Conference on Machine Learning  ECML 2004. Springer LNAI 3201. September 2004.
10. Jean-Francois Boulicaut and Olivier Gandrillon (coordinateurs). Informatique pour l'analyse du transcriptome. Hermes Lavoisier, traité IC2, 2004  (In French).
11. Jean-Francois Boulicaut and Saso Dzeroski Eds. Proc. 2nd International Workshop on Knowledge Discovery in Inductive Databases KDID'03 co-located with ECML-PKDD 2003, Cavtat-Dubrovnik (Croatia), September 22, 2003. ISBN:953-6690-34-9. Download.

Journal publications or book chapters

Provided electronic materials ensure timely dissemination of scholarly and technical contributions. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

1. Ruggero G. Pensa, Jean-Francois Boulicaut, Francesco Cordero, Maurizio Atzori. Co-clustering Numerical Data under User-defined Constraints. Statistical Analysis and Data Mining journal, 3(1)38-55, 2009. Draft here.

2. Loïc Cerf, Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Closed Patterns Meet n-ary Relations. ACM Transactions on Knowledge Discovery in Data 3(1) pp. 3:1-3:37. ACM Press. March 2009. Draft here.

3.   Ieva Mitasiunaite, Christophe Rigotti, Stéphane Schicklin, Laurène Meyniel, Jean-Francois Boulicaut, Olivier Gandrillon. Extracting Signature Motifs from Promoter Sets of Differentially Expressed Genes. In Silico Biology 8(0043), 2008. Bioinformation Systems e.V. Document also available from here.

4.    Johan Leyritz, Stéphane Schicklin, Sylvain Blachon, Céline Keime, Céline Robardet, Jean-Francois Boulicaut, Jérémy Besson, Ruggero G. Pensa, Olivier Gandrillon. SQUAT: a web tool to mine human, murine, and avian SAGE data. BMC Bioinformatics 9:378, 2008.

5.   Ruggero G. Pensa, Céline Robardet, Jean-Francois Boulicaut. Constraint-driven Co-Clustering of 0/1 Data: In: Constrained Clustering: Advances in Algorithms, Theory and Applications, S. Basu, I. Davidson, and K. Wagstaff (Eds), Chapman & Hall/CRC Press,  Data Mining and Knowledge Discovery Series, pp. 123-148, July 2008. Draft here.

6. Sylvain Blachon, Ruggero G. Pensa, Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut, Olivier Gandrillon. Clustering formal concepts to discover biologically relevant knowledge from gene expression data (see also here) In Silico Biology 7(0033), 2007. Bioinformation Systems e.V. 

7. Ieva Mitasiunaité, Jean-Francois Boulicaut. Introducing softness into inductive queries on string databases. In: Databases and Information Systems IV. Vol. 155 Frontiers in Artificial Intelligence and Applications, O. Vasilecas, J. Eder, A. Caplinskas (Eds.), 2007, pp. 117-132.  © IOS Press.

8. Jérémy Besson, Céline Robardet, Luc De Raedt, Jean-Francois Boulicaut. Mining bi-sets in numerical data. In: Knowledge Discovery in Inductive Databases 5th Int. Workshop KDID'06 Revised Selected and Invited Papers, S. Dzeroski and J. Struyf (Eds), Springer LNCS 4747, 2007, pp. 11-23.  © Springer.

9. Ruggero G. Pensa, Céline Robardet, Jean-Francois Boulicaut. Supporting bi-cluster interpretation in 0/1 data by means of local patterns.Intelligent Data Analysis 10(5):457-472, 2006. © IOS Press. Draft here

10. Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut, Sophie. Rome. Constraint-based concept mining and its application to microarray data analysis. Intelligent Data Analysis 9(1):59-82, 2005. © IOS Press. Draft here.

11. Jérémy Besson, Ruggero G. Pensa, Céline Robardet, Jean-Francois Boulicaut. Constraint-based mining of fault-tolerant patterns from Boolean data. In: Knowledge Discovery in Inductive Databases KDID'05 Revised Selected and Invited Papers, F. Bonchi and J-F. Boulicaut (Eds), Springer LNCS 3933, 2006,  pp. 55-71. © Springer.

12. Ruggero G. Pensa, Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Contribution to gene expression data analysis by means of set pattern mining. In: Constraint-based mining and Inductive Databases. Springer LNCS 3848, J-F. Boulicaut, L. De Raedt, H. Mannila (Eds.), 2005, pp. 328-347. © Springer.

13. Toon Calders, Christophe Rigotti, Jean-Francois Boulicaut. A survey on condensed representations for frequent sets. In: Constraint-based mining and Inductive Databases. Springer LNCS 3848, J-F. Boulicaut, L. De Raedt, H. Mannila (Eds.), 2005, pp. 64-80. © Springer.

14. Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Mining formal concepts with a bounded number of exceptions from transactional data. In: Knowledge Discovery in Inductive Databases KDID'04, Revised Selected and Invited Papers, B. Goethals and A. Siebes (Eds.), Springer LNCS 3377, 2005, pp. 33-45. © Springer.

15. Ruggero G. Pensa, Jean-Francois Boulicaut. Boolean property encoding for local set pattern discovery: an application to gene expression data analysis. In: Local Pattern Detection: International Seminar, Dagstuhl Castle, Germany, April 12-16, 2004, Revised Selected Papers, Springer LNAI 3539, K. Morik, J-F. Boulicaut, A. Siebes (Eds.), 2005, pp. 115-134. © Springer.

16. Jean-Francois Boulicaut, Cyrille Masson. Data mining query languages. In: The Data Mining and Knowledge Discovery Handbook, O. Maimon and L. Rokach (Eds.), Springer, 2005, pp. 715-727.

17. Jean-Francois Boulicaut, Baptiste Jeudy. Constraint-based data mining. In: The Data Mining and Knowledge Discovery Handbook, O. Maimon and L. Rokach (Eds.), Springer, 2005, pp. 399-416.

18. Jean-Francois Boulicaut, Condensed representations for data mining. In: Encyclopedia of Data Warehousing and Mining, J. Wang (Ed.), Idea Group Reference, 2005, pp. 207-211. Draft here.

19. Marco Botta, Jean-Francois Boulicaut, Cyrille Masson, Rosa Meo. Query languages supporting descriptive rule mining: a comparative study. In: Database Support for Data Mining Applications - Discovering Knowledge with Inductive Queries,  Springer LNCS 2682, R. Meo, P-L. Lanzi, and M. Klemettinen (Eds.), 2004. pp. 27-56. © Springer.

20. Jean-Francois Boulicaut. Inductive databases and multiple uses of frequent itemsets: the cInQ approach. In: Database support for Data Mining Applications - Discovering Knowledge with Inductive Queries, Springer LNCS 2682, R. Meo, P-L. Lanzi, and M. Klemettinen (Eds.), 2004. pp. 3-26. © Springer.

21. Baptiste Jeudy, Jean-Francois Boulicaut. Constraint-based discovery and inductive queries: application to association rule mining. In: Pattern Detection and Discovery in Data Mining, European Science Foundation Exploratory Workshop, Springer LNAI 2447, D. J. Hand, N. M. Adams, R. J. Bolton (Eds.), 2002. pp. 110-124. © Springer.

22. Jean-Francois Boulicaut, Artur Bykowski, Christophe Rigotti. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery 7(1):5-22, 2003.  © Kluwer Academics Publishers. See here.

23. Céline Becquet, Sylvain Blachon, Baptiste Jeudy, Jean-Francois Boulicaut, Olivier Gandrillon. Strong-association-rule mining for large-scale gene-expression data analysis: a case study on human SAGE data.  Genome Biology 3(12):1-16, 2002. See here.

24. Baptiste Jeudy, Jean-Francois Boulicaut. Optimization of association rule mining queries.  Intelligent Data Analysis, 6(4):341-357, 2002. © IOS Press. Draft here.

25. Jean-Francois Boulicaut. A KDD framework for database audit.  Information Technology and Management international journal 1(3):195-207, 2000, Special issue on Information Technologies in Support of Business Processes. © Baltzer Science Publisher. This is an extended version of the paper presented at WITS'98.

Publications in proceedings of conferences or workshops (refered full papers)

When acceptance rates were unknown, > 50% has been assumed.

1.   Loïc Cerf, Pierre-Nicolas Mougel, Jean-Francois Boulicaut. Agglomerating Local Patterns Hierarchically with Alpha. Proc. 18th ACM Conf. on Information and Knowledge Management CIKM'09, Hong Kong (China), 2-6 November 2009, pp. 1753-1756. Acceptance Rate when including short papers 34%.

2.   Loïc Cerf, Tran Bao Nhan Nguyen, Jean-Francois Boulicaut. Discovering relevant cross-graph cliques in dynamic networks. Proc. 18th Int. Symp. on Methodologies for Intelligent Systems ISMIS'09, Prague (CZ), J. Rauch et al. (Eds). Springer LNCS 5722, pp. 513-522. Acceptance Rate 54%

3.   Dominique Gay, Nazha Selmaoui, Jean-Francois Boulicaut. Application-independent feature construction from noisy samples. Proc. 13th Pacific-Asia Conference on Knowledge Discovery and Data Mining PaKDD'09, Bangkok, Thailand, 27-30 April 2009. I. Theeramunkong, B. Kijsirikul, N. Cercone, Ho Tu Bao (Eds). Springer LNCS 5476, pp. 965-972. Acceptance Rate when including short papers 33%.

4.   Jérémy Besson,  Christophe Rigotti, Ieva Mitasiunaite, Jean-Francois Boulicaut. Parameter Tuning for Differential Mining of String Patterns. Proc. 2nd Int. Workshop on Domain Driven Data Mining DDDM'08 co-located with IEEE ICDM'08, Pisa, Italy, December 15, 2008. F. Bonchi et al. (Eds.), pp. 77-86. IEEE Computer Society. Acceptance Rate 26%.

5.   Jean-Francois Boulicaut. If constraint-based mining is the answer: what is the constraint? (invited abstract) Proc. Int. Workshop on Semantic Aspects of Data Mining SADM'08 co-located with IEEE ICDM'08, Pisa, Italy, December 19, 2008. F. Bonchi et al. (Eds.), pp. 730. IEEE Computer Society.

6.   Loïc Cerf, Dominique Gay, Nazha Selmaoui, Jean-Francois Boulicaut. A parameter-free associative classification method.  Proc. 10th Int. Conf. on Data Warehousing and Knowledge Discovery DaWaK'08, Torino, Italy, September 1-5, 2008. I.-Y. Song, J. Eder, T. M. Nguyen (Eds.). Springer LNCS 5182, pp. 293-304.  © Springer.  Acceptance Rate 33%.

7.   Jérémy Besson,  Loïc Cerf, Rémi Thevenoux, Jean-Francois Boulicaut. Tackling closed pattern relevancy in n-ary relations. Proc. 1st Workshop Mining Multidimensional Data MMD'08 co-located with ECML PKDD 2008, Antwerp, Belgium, September 15-19, 2008. A. Laurent and J. Pei (Eds.), pp. 2-16. Acceptance Rate 37.5%.

8.   Ruggero G. Pensa, Jean-Francois Boulicaut. Numerical Data Co-clustering via Sum-Squared Residue Minimization and User-defined Constraint Satisfaction (extended abstract). Proc. 16th Italian Symp. on Advanced Database Systems SEBD 2008, Mondello (PA), Italy, June 22-25, 2008. pp. 279-286. Acceptance rate > 50%

9.    Loïc Cerf, Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Data_Peeler: Constraint-based Closed Pattern Mining in n-ary Relations.  Proc. SIAM Int. Conf. on Data Mining SDM'08, Atlanta, USA, April 24-26, 2008, pp. 37-48. Acceptance rate 14%.

10.   Ruggero G. Pensa, Jean-Francois Boulicaut. Constrained co-clustering of gene expression data. Proc. SIAM Int. Conf. on Data Mining SDM'08, Atlanta, USA, April 24-26, 2008, pp. 25-36. Acceptance rate 14%.

11.   Dominique Gay, Nazha Selmaoui, Jean-Francois Boulicaut. Feature construction based on closedness properties is not that simple. Proc. 12th Pacific-Asia Conf. on Knowledge Discovery and Data Mining  PaKDD 2008, Osaka, Japan, 20-23 May, 2008, T. Washio, E. Suzuki, K. Ming Ting, A. Inokuchi (Eds.). Springer LNCS 5012, pp. 112–123. © Springer.  Acceptance rate 12%
12.   Jean-Francois Boulicaut, Jérémy Besson. Actionability and formal concepts: a data mining perspective (invited contribution) Proc. 6th International Conference on Formal Concept Analysis ICFCA'08, Montréal, Canada, February 25-28, 2008, R. Medina and S. Obiedkov (Eds). Springer LNAI 4933, pp. 14-31. © Springer.
13. Dominique Gay, Nazha Selmaoui, Jean-Francois Boulicaut. Pattern-based decision tree construction. Proc. 2nd International Conference on Digital Information Management ICDIM 2007, Lyon, France, October 28-31, 2007, IEEE Computer Press. pp. 291-296. Acceptance rate 43 %.
14. Yolanda Sanchez-Dehesa, Loïc Cerf, Jose-Maria Pena, Jean-Francois Boulicaut, Guillaume Beslon. Artificial Regulatory Network Evolution. Proc. Int. Workshop Machine Learning in Systems Biology MLSB'07, Evry (F), September 24-25, 2007, pp. 47-52. Acceptance rate > 50%.
15. Jérémy Besson, Céline Robardet, Luc De Raedt, Jean-Francois Boulicaut. Mining numerical bi-sets. Proc. 5th Int. Workshop on Knowledge Discovery in Inductive Databases KDID'06 co-located with ECML-PKDD 2006, Berlin, Germany, September 18, 2006, S. Dzeroski and J. Struyf (Eds). pp. 9-19. Acceptance rate > 50%.
16. Nazha Selmaoui, Claire Leschi, Dominique Gay, Jean-Francois Boulicaut. Feature Construction and Delta-Free Sets in 0/1 Samples (regular paper). Proc. 9th Int. Conf. on Discovery Science DS'06, Barcelona, Spain, October 7-10, 2006, N. Lavrac, L. Todorovski, and K.P. Jantke (Eds.). Springer LNAI 4265, pp. 363–367. © Springer. Acceptance rate for regular papers 47 %.
17. Ruggero G. Pensa, Céline Robardet, Jean-Francois Boulicaut. Towards constrained co-clustering in ordered 0/1 data sets. Proc. 16th Int.  Symp. on Methodologies for Intelligent Systems ISMIS'06, Bari (I), September 27-29, 2006, F. Esposito, Z. W. Ras, D. Malerba, G. Semeraro (Eds). Springer LNAI 4203, pp. 425-434. © Springer. Acceptance rate 40%.
18. Clément Faure, Sylvie Delprat, Jean-Francois Boulicaut, Alain Mille. Iterative bayesian network implementation by using annotated association rules. Proc. 15th Int.  Conf. on Knowledge Engineering and Knowledge Management EKAW'06, Podebrady, Czech Republic, 2nd-6th October 2006, S. Staab and V. Svatek (Eds.). Springer LNAI 4248, pp. 326-333. © Springer. Acceptance rate 28%.
19. Ieva Mitasiunaité, Jean-Francois Boulicaut. About softness for inductive querying on sequence databases. Proc. 7th Int.  Baltic Conf. on Databases and Information Systems DB&IS 2006,Vilnius, Lithuania, July 3-6, 2006. pp. 77-82. © IEEE. Acceptance rate 32 %.

20. Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. Proc. 14th Int.  Conf. on Conceptual Structures ICCS'06, Aalborg, Denmark, July 16-21, 2006, H. Scharfe, P. Hitzler, P. Ohrstrom (Eds.). Springer LNAI 4068, 2006, pp. 144-157. © Springer. Acceptance rate 39%.

21. Ieva Mitasiunaité, Jean-Francois Boulicaut. Looking for monotonicity properties of a similarity constraint on sequences. Proc. 2006 ACM Symposium of Applied Computing SAC'2006, Special Track on Data Mining, April 23 - 27, 2006, Dijon, France. ACM Press, pp. 546-552. © ACM. Acceptance rate 32 %.

22. Jérémy Besson, Ruggero G. Pensa, Céline Robardet, Jean-Francois Boulicaut. Constraint-based mining of fault-tolerant patterns from Boolean data. Proc. 4th Int.  Workshop on Knowledge Discovery in Inductive Databases KDID'05 co-located with ECML-PKDD 2005, Porto, Portugal, October 20, 2005, F. Bonchi and Jean-Francois Boulicaut (Eds), pp. 13-26. Acceptance rate > 50%.

23. Ruggero G. Pensa, Céline Robardet, Jean-Francois Boulicaut. A bi-clustering framework for categorical data (short paper). Proc. 9th European Conf. on Principles and practice of Knowledge Discovery in Databases PKDD 2005, Porto, Portugal, October 3-7, 2005. Springer LNAI 3721, A. Jorge, L. Torgo, P. Brazdil, R. Camacho, J. Gama (Eds), pp. 643-650, 2005. © Springer. Acceptance rate including short papers 28 %.

24. Ruggero G. Pensa, Jean-Francois Boulicaut. From local pattern mining to relevant bi-cluster characterization. Proc. 6th Int.  Symp. on Intelligent Data Analysis IDA 2005, Madrid, Spain, September 8-10, 2005. Springer LNCS 3646, A. F. Famili, J-M. Pena, A. Siebes, J. Kok (Eds.), pp. 293-304, 2005. © Springer. Acceptance rate 25%.

25. Ruggero G. Pensa, Jean-Francois Boulicaut. Towards fault-tolerant formal concept analysis. Proc. 9th Congress of the Italian Association for Artificial Intelligence AI*IA'05, University of Milano – Bicocca, September 21-23, 2005, Springer LNAI 3673,  S. Bandini and S. Manzoni (Eds.), pp. 212-223, 2005 © Springer. Acceptance rate > 50%.

26. Ruggero G. Pensa, Jérémy Besson, Jean-Francois Boulicaut. A methodology for biologically relevant pattern discovery from gene expression data. Proc. 7th Int.  Conf. on Discovery Science DS 2004, E. Suzuki and S. Arikawa (Eds.), Padova, Italy, October 2-5, 2004. Springer LNAI 3245, pp. 230-241. © Springer. Acceptance rate 25%.

27. Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Mining alpha-beta concepts as relevant bi-sets from transactional data. Proc. 3rd Int.  Workshop on Knowledge Discovery in Inductive Databases KDID'04 co-located with ECML/PKDD 2004, B. Goethals and A. Siebes (Eds.), Pisa (I), September 20, 2004. pp. 13-24. Acceptance rate > 50%.

28. Ruggero G. Pensa, Claire Leschi, Jérémy Besson, Jean-Francois Boulicaut. Assessment of discretization techniques for relevant pattern discovery from gene expression data. Proc. 4th ACM Workshop on Data Mining in Bioinformatics BIOKDD'04 co-located with ACM SIGKDD'04, M. J. Zaki, S. Morishita and I. Rigoutsos (Eds.), Seattle, USA, August 2004, pp. 24-30. © ACM. Acceptance rate 38 %

29. Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Constraint-based mining of formal concepts in transactional data. Proc. 8th Pacific-Asia Conf. on Knowledge Discovery and Data Mining PaKDD’04, H. Dai, R. Srikant, and C. Zhang (Eds.), Sydney (Australia), May 26-28, 2004. Springer LNCS 3056, pp. 615-624. © Springer. Acceptance rate 21 %.

30. Céline Robardet, Ruggero G. Pensa, Jérémy Besson, Jean-Francois Boulicaut. Using classification and visualization on pattern databases for gene expression data analysis. Proc. 1st Int.  Workshop on Pattern Representation and Management PaRMa'04 co-located with EDBT 2004, Y. Theodoridis and P. Vassiliadis (Eds); Heraclion - Crete, Greece, March 18, 2004. CEUR Workshop Proc. Vol. 16, pp. 107-118. Acceptance rate > 50%.

31. Cyrille Masson, Céline Robardet, Jean-Francois Boulicaut. Optimizing subset queries: a step towards SQL-based inductive databases for itemsets. Proc. 2004 ACM Symposium of Applied Computing (SAC'2004), Special Track on Data Mining,  H. Haddad, A. Omicini,  R. L. Wainwright and L.M. Liebrock (Eds.), March 14 - 17, 2004, Nicosia, Cyprus. ACM Press. pp. 535-539. © ACM. Acceptance rate 36 %.

32. Marion Leleu, Christophe Rigotti, Jean-Francois Boulicaut, Guillaume Euvrard. Constraint-based sequential pattern mining over datasets with consecutive repetitions. Proc. 7th European Conference on Principles and Practice of Knowledge Discovery in Databases PKDD 2003, N. Lavrac , D. Gamberger, H. Blockeel and L. Todorovski (Eds.), Cavtat-Dubrovnik (Croatia), September 22-26, 2003  Springer LNCS 2838. pp. 303-314. © Springer. Acceptance rate 24 %

33. Hunor Albert-Lorincz, Jean-Francois Boulicaut. A framework for frequent sequence mining under generalized regular expression constraints. Proc. 2nd Int.  Workshop on Knowledge Discovery in Inductive Databases KDID'03 co-located with ECML-PKDD 2003, J-F. Boulicaut and S. Dzeroski (Eds.), Cavtat-Dubrovnik (Croatia), September 22, 2003. pp. 2-16. ISBN 953-6690-34-9. Acceptance rate > 50%.

34. Francois Rioult, Céline Robardet, Sylvain Blachon, Bruno Cremilleux, Olivier Gandrillon, Jean-Francois Boulicaut. Mining concepts from large SAGE gene expression matrices. Proc. 2nd Int.  Workshop on Knowledge Discovery in Inductive Databases KDID'03 co-located with ECML-PKDD 2003, J-F. Boulicaut and S. Dzeroski (Eds.), Cavtat-Dubrovnik (Croatia), September 22, 2003  pp. 107-118. ISBN 953-6690-34-9. Acceptance rate > 50%.

35. Kimmo Hatonen, Jean-Francois Boulicaut, Mika Klemettinen, Markus Miettinen, Cyrille Masson. Comprehensive log compression with frequent patterns. Proc. 5th Int.  Conf. on Data Warehousing and Knowledge Discovery DaWaK 2003, Y. Kambayashi, M. K. Mohania and W. Wöss (Eds.), Prague (CZ),  September 3-5, 2003. Springer LNCS 2737. pp. 360-370.  © Springer. Acceptance rate 40%.

36. Francois Rioult, Jean-Francois Boulicaut, Bruno Cremilleux, Jérémy Besson. Using transposition for pattern discovery from microarray data. Proc.  8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, M. J. Zaki and C.C. Aggarwal (Eds.), June 13th, 2003, San Diego (USA). pp. 73-79. Acceptance rate 28 %.

37. Marion Leleu, Christophe Rigotti, Jean-Francois Boulicaut, Guillaume Euvrard. GO-SPADE: mining sequential patterns over datasets with consecutive repetitions. Proc. IAPR 3rd  Int.  Conf. on Machine Learning and Data Mining in Pattern Recognition MLDM'03, P. Perner and A. Rosenfeld (Eds), Leipzig (Germany), July 5-7, 2003. Springer LNCS 2734. pp. 293-306.  © Springer. Acceptance rate 44 %.

38. Hunor Albert-Lorincz, Jean-Francois Boulicaut. Mining frequent sequential patterns under regular expressions: a highly adaptive strategy for pushing constraints. Proc. 3rd SIAM Int.  Conference on Data Mining SDM'03, D. Barbara and C. Kamath (Eds.), San Francisco (USA), May 1-3, 2003. pp. 316-320. Acceptance rate 39 %.

39. Bruno Cremilleux, Jean-Francois Boulicaut. Simplest rules characterizing classes generated by delta-free sets. Proc. 22nd BCS SGAI Int.  Conf. on Knowledge Based Systems and Applied Artificial Intelligence ES 2002, Cambridge (UK), 10-12 December 2002. pp. 33-46.  © Springer. Acceptance rate > 50 %.

40. Marion Leleu, Jean-Francois Boulicaut. Signing stock market situations by means of characteristic sequential patterns. Proc. 3rd Int.  Conf. on Data Mining Methods and Databases for Engineering, Finance and Other Fields Data Mining 2002, Bologna (I), 25 - 27 September 2002. pp. 655-664. © WIT Press. Acceptance rate > 50%.

41. Baptiste Jeudy, Jean-Francois Boulicaut. Using condensed representations for interactive association rule mining. Proc. 6th European Conf. on Principles and practice of Knowledge Discovery in Databases PKDD 2002, Helsinki (FIN), 19-23 August 2002. Springer LNAI 2431, pp. 225-236. © Springer. Acceptance rate 32 %.

42. Marco Botta, Jean-Francois Boulicaut, Cyrille Masson, Rosa Meo. A comparison between query languages for the extraction of association rules. Proc. of the Fourth Int.  Conference on Data Warehousing and Knowledge Discovery DaWaK'02, Aix-en-Provence (F), September 4-6, 2002. Springer LNCS 2454. pp. 1-10. © Springer. Acceptance rate 40 %.

43. Matthieu Capelle, Cyrille Masson, Jean-Francois Boulicaut. Mining frequent sequential patterns under a similarity constraint. Proc. of the Third Int.  Conference on Intelligent Data Engineering and Automated Learning IDEAL 2002, Manchester (UK), August 12-14, 2002. Springer LNCS 2412. pp. 1-6. © Springer. Acceptance rate > 50 %.

44. Céline Robardet, Bruno Cremilleux, Jean-Francois Boulicaut. Characterization of unsupervized clusters by means of the simplest association rules: an application for child's meningitis. Proc. of the 7th Workshop on Intelligent Data Analysis in Medicine and Pharmacology IDAMAP'02, co-located with ECAI'02, Lyon (F), July 23, 2002. pp. 61-65. Acceptance rate > 50 %.

45. Jean-Francois Boulicaut, Baptiste Jeudy. Constraint-based discovery of a condensed representation for frequent patterns. Proc. of the Workshop Database Support for KDD co-located with  ECML/PKDD'01, Freiburg (D), September 7, 2001. pp. 3-13. Acceptance rate > 50%.

46. Jean-Francois Boulicaut, Bruno Cremilleux. Delta-strong classification rules for predicting collagen diseases. Proc. of the PKDD'01 Discovery Challenge on Thrombosis Data co-located with  ECML/PKDD'01, Freiburg (D), September 6, 2001. pp. 29-38. Available on line. Acceptance rate > 50%.

47. Jean-Francois Boulicaut, Bruno Cremilleux. Delta-strong classification rules for characterizing chemical carcinogens. Proc. of the Predictive Toxicology Challenge for 2000-2001 co-located with the 5th European Conference on Principles and Practice of Knowledge Discovery in Databases ECML/PKDD'01, Freiburg (D), September 6, 2001. Available on line. Acceptance rate > 50%.

48. Jean-Francois Boulicaut, Patrick Marcel, Christophe Rigotti. Query driven knowledge discovery via OLAP manipulations. Actes des 17ème Journées Bases de Données Avancées BDA'01, Agadir (Maroc), Octobre 2001. Cepadues Editions. pp. 311-323. © Cepadues. Acceptance rate > 50 %.

49. Jean-Francois Boulicaut, Baptiste Jeudy. Mining Free Sets under Constraints.In: Proc. of the Int.  Database Engineering and Applications Symposium IDEAS'01, Grenoble (F), July 2001, IEEE Computer Press. pp. 322-329. © IEEE Computer Press. Acceptance rate 45 %.

50. Jean-Francois Boulicaut, Baptiste Jeudy. Using Constraints during Itemset Mining: should we Prune or not? Actes des Seizième Journées Bases de Données Avancées BDA'00, Blois (F), 24-27 Octobre 2000. pp. 221-237. Acceptance rate 50 %.

51. Jean-Francois Boulicaut, Artur Bykowski, and Baptiste Jeudy. Towards the Tractable Discovery of Association Rules with Negations. Proc. of the Fourth Int.  Conference on Flexible Query Answering Systems FQAS'00, Warsaw (PL), October 25-28, 2000. Physica-Verlag, Advances in Soft Computing. pp. 425-434. © Physica-Verlag. An extended version associated to experimental results is available as an unpublished research report (see below). Acceptance rate > 50 %.

52. Jean-Francois Boulicaut, Artur Bykowski, and Christophe Rigotti. Approximation of frequency queries by means of free-sets. Proc. 4th European Conf. on Principles and Practice of Knowledge Discovery in Databases PKDD'00, Lyon (F), September 13-16, 2000. Springer LNAI 1910, pp. 75-85. © Springer. Acceptance rate 18 %.

53. Jean-Francois Boulicaut, Artur Bykowski, L. Gomez-Chantada. Association Rule Discovery in Highly-Correlated Data: a Case Study in Web Usage Mining. Proc. of Challenges, 2000 ADBIS-DASFAA Symposium, Prague, Czech Republic, September 5-8, 2000. Matfyz Press ISBN 80-85863-56-1, pp. 46-55. Acceptance rate > 50%.

54. Jean-Francois Boulicaut, Artur Bykowski. Frequent closures as a concise representation for binary data mining. Proc. of the 4th Pacific-Asia Conf. on Knowledge Discovery and Data Mining PaKDD’00, Kyoto (JP), April 18-20, 2000. Springer LNAI 1805, pp. 62-73. © Springer. Acceptance rate 28 %.

55. Jean-Francois Boulicaut, Patrick Marcel, Christophe Rigotti. Query driven Knowledge Discovery in Multidimensional Data.  Proc. ACM 2nd. Int.  Workshop on Data Warehousing and OLAP DOLAP'99 , Kansas City (USA), November 6, 1999. ACM Press, pp.87-93. © ACM Press.

56. Jean-Francois Boulicaut. Query Languages for Knowledge Discovery in Databases (tutorial abstract).  Proc. 3rd European Conf. on Principles of Data Mining and Knowledge Discovery PKDD'99, Prague (CZ), 15-18 September 1999, Springer LNAI 1704, pp. 382-383. © Springer

57. Jean-Francois Boulicaut, Mika Klemettinen, Heikki Mannila. Modeling KDD Processes within the Inductive Database Framework. Proc. of the First Int.  Conference on Data Warehousing and Knowledge Discovery DaWak'99, Florence (I), August 30-September 1, 1999. Springer LNCS 1676, pp. 293-302. © Springer

58. Jean-Francois Boulicaut, Mika Klemettinen, Heikki  Mannila. Querying inductive databases: a case study on the MINE RULE operator.Proc. of the Second European Symposium on Principles of Data Mining and Knowledge Discovery PKDD'98, Nantes (F), September 23-26, 1998, Springer LNAI 1510, pp. 194-202. © Springer

59. Jean-Francois Boulicaut, Patrick Marcel, Francois Pinet, Christophe Rigotti. Spreadsheet generation using rule-based specifications. Proceeding 6th Int.  Workshop on Deductive Databases and Logic Programming DDLP'98, Manchester (UK), June 20, 1998, (P. Fraternali, U. Geske, C. Ruiz and D. Seipel, editors), pp. 59-70.

60. Jean-Francois Boulicaut. A formal framework for database audit.Proc. of the Eight Annual Workshop on Information Technologies and Systems WITS'98, Helsinki (FIN), december 12-13, 1998, pp 257-266. Best paper nominee.

61. Jean-Marc Petit, Farouk Toumani, Jean-Francois Boulicaut, Jacques Kouloumdjian. Towards the reverse engineering of denormalized relational databases. Proc. 12th IEEE Int.  Conf. on Data Engineering ICDE'96, New-Orleans (USA), February 26 - March 1, 1996, IEEE Press, pp. 218-227.

62. Christophe Rigotti, Mohand S. Hacid, Jean-Francois Boulicaut. F-Logic programming and terminological constraints. Proc. of the post-conference ICLP'94 Workshop on the Integration of Declarative Paradigms, (M. Hanus Ed.), Santa Margherita Ligure (I), June 18th, 1994, pp 3-12.

63. Jean-Marc Petit, Jacques Kouloumdjian, Jean-Francois Boulicaut, Farouk Toumani. Using queries to improve database reverse engineering. Proc. 13th Int.  Conf. on the Entity-Relationship Approach ER'94, Manchester (UK), December 13-16 1994, Springer LNCS 881, 1994, pp. 369-386.

64. Christophe Rigotti, Mohand S. Hacid, Jean-Francois Boulicaut. Does a deductive object-oriented system produce object-oriented answers? A hybrid reasoning approach. Actes du dixième congrès INFORSID'94, Aix en Provence (F), 18-20 mai 1994, pp. 99-110.

65. Alexandre S. Saidi, Jean-Francois Boulicaut. Checking and debugging of two-level grammars.  Proc. 4th Int.  Symp. on Programming Language Implementation and Logic Programming PLILP'92, August 26-28 1992, Leuven (B ), Springer, LNCS 631, 1992, pp. 158-171.

66. Jean Beney, Jean-Francois Boulicaut. STARLET : an affix-based compiler compiler designed as a logic programming system. Proc. 3rd Int.  Conf. on Compiler Compilers CC'90, october 22-24, 1990, Schwerin (D), Springer, LNCS 477, 1 991, pp. 71-85.

67. Helen M. Gigley, Jean-Francois Boulicaut. GRASPER: a graph processing tool for knowledge engineering in cognitive modeling. Proc. of the Int.  Conference COGNITIVA'85, Paris (F), June 3-7 1985, (CESTA Ed.), pp. 527-534.

Publications in French

1.    Nazha Selmaoui, Dominique Gay, Jean-Francois Boulicaut. Construction de descripteurs pour apprendre à classer à partir d'exemples bruités.  Actes des 9ème Journées Francophones Extraction et Gestion de Connaissances EGC'09, Strasbourg (F), 27-30 janvier 2009, Cépadues-Editions, RNTI-E-15,  pp. 91-102.  

2.    Loïc Cerf, Jérémy Besson, Jean-Francois Boulicaut. Extraction de motifs fermés dans des relations n-aires bruitées. Actes des 9ème Journées Francophones Extraction et Gestion de Connaissances EGC'09, Strasbourg (F), 27-30 janvier 2009, Cepadues-Editions, RNTI-E-15,  pp. 163-168.

3.    Ruggero G. Pensa, Jean-Francois Boulicaut. Co-classification sous contraintes par la somme des résidus quadratiques. Actes des 8eme Journées Francophones Extraction et Gestion de Connaissances EGC'08, Sophia-Antipolis (F), 29 janvier - 1° fevrier 2008, Cepadues Editions RNTI-E-11, pp. 655-666.

4. Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Un algorithme générique d'extraction de bi-ensembles sous contraintes dans des donnees booléennes. Revue Information Interaction Intelligence I3. Cépadues Edititions. Numéro Hors-Série 2007, pp. 141-160.

5. Loïc Cerf, Jérémy Besson, Céline Robardet. Extraction d'hyper-rectangles fermés sous contraintes. Contribution avec résumé étendu à l'Atelier Bases de Données Inductives BDI'07 organisé dans le cadre de la plate-forme AFIA, Grenoble (F), juillet 2007.

6. Ruggero G. Pensa, Céline Robardet, Jean-Francois Boulicaut. Co-classification sous contraintes. Actes de la conférence francophone d'apprentissage automatique CAp 2006, Trégastel (F), 22-24 mai 2006, Presses Universitaires de Grenoble, pp. 155-170.

7. Clément Faure, Sylvie Delprat, Alain Mille, Jean-Francois Boulicaut. Construction itérative d'un modèle de connaissance par l'exploitation de règles d'asssociation. Actes des 17ème Journées Francophones Ingénierie des Connaissances IC'06, Nantes (F), 28-30 juin 2006, pp. 1-10.

8. Hunor Albert-Lorincz, Jean-Francois Boulicaut. Amélioration des indicateurs techniques pour l'analyse du marché financier. Actes des 6ème Journées Francophones Extraction et Gestion de Connaissances EGC'06, Lille (F), 17-20 janvier 2006, Cepadues RNTI-E-6, pp. 693-704.

9. Clément Faure, Sylvie Delprat, Alain Mille, Jean-Francois Boulicaut. Utilisation des réseaux bayésiens dans le cadre de l'extraction de règles d'association. Actes des 6ème Journées Francophones Extraction et Gestion de Connaissances EGC'06, Lille (F), 17-20 janvier 2006, Cepadues RNTI-E-6, pp. 569-580.

10. Jérémy Besson, Céline Robardet, Jean-Francois Boulicaut. Approximation de collections de concepts formels par des bi-ensembles denses et pertinents. Actes de la conférence francophone d'apprentissage automatique CAp 2005, Nice (F), 1-3 juin 2005, Presses Universitaires de Grenoble, pp. 313-328.

11. Jean-Francois Boulicaut. Fouille de données sous contrainte et bases de données inductives (conférence invitée). Actes des Premières journées Francophones de Programmation par Contraintes JFPC'05, Lens (F), 8-10 juin 2005.

12. Sylvain Blachon, Céline Robardet, Jean-Francois Boulicaut, O. Gandrillon. Extraction de connaissances dans des données d'expression SAGE humaines. Chapitre 7 de Informatique pour l'analyse du transcriptome, pages 207-230. Hermes Lavoisier, traité IC2, 2004.

13. Jérémy Besson, Francois Rioult, Bruno Crémilleux, Sophie Rome, Jean-Francois Boulicaut. Solutions pour le calcul d'ensembles fréquents dans des données biopuces. Chapitre 8 de Informatique pour l'analyse du transcriptome, pages 231-254. Hermes Lavoisier, traité IC2, 2004.

14. Céline Robardet, Claire Nedellec, Jean-Francois Boulicaut. Fouille de données et analyse du transcriptome. Chapitre 4 de Informatique pour l'analyse du transcriptome, pages 101-141, Hermes Lavoisier, traité IC2, 2004.

15. Sylvain Blachon, Céline Robardet, Jean-Francois Boulicaut, Olivier Gandrillon. Extraction de régularités dans des données d'expression SAGE humaines. Actes de la journée Informatique pour l'analyse du transcriptome JPGD'03, Lyon (F), 14 Mai 2003. 18 pages.

16.  Jean-Francois Boulicaut, F. Rioult, Jérémy Besson, Bruno Cremilleux, S. Rome. Faisabilité des extractions d'ensembles fréquents dans des données biopuces : éléments de solution. Actes de la journée Informatique pour l'analyse du transcriptome JPGD'03, Lyon (F), 14 Mai 2003. 13 pages.

17. Matthieu Capelle, Jean-Francois Boulicaut, Cyrille Masson. Extraction de motifs séquentiels sous contrainte de similarité. Actes des Journées francophone d'Extraction et de Gestion de Connaissances EGC'02. Montpellier, janvier 2002. Hermes. pp. 65-76.

18. Marion Leleu, Jean-Francois Boulicaut. Signature de situations boursières représentées par des séquences d'événements. Actes des Journées francophone d'Extraction et de Gestion de Connaissances EGC'02. Montpellier, janvier 2002. Hermes. pp. 89-100.

19. Bruno Crémilleux, Jean-Francois Boulicaut. Utilisation de règles delta-fortes pour caractériser des classes. Actes du13e Congrès Francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle RFIA'02, Angers (France), 8-10 Janvier 2002. pp. 685-694.

20. Jean-Francois Boulicaut. Quelques problèmes ouverts pour la découverte de règles dans les bases de données (conférence invitée). Actes des Rencontres Francophones sur la logique floue et ses applications LFA'00, octobre 2000, La Rochelle (F). pp. 357-361. Cepadues Editions.

21. Jean-Francois Boulicaut, Christophe Rigotti. Abduction et déduction de structures d'objets : une intégration multi-paradigmes. Actes des 5° Journées Francophones de Programmation Logique et de programmation par Contraintes JFPLC'96, Clermont-Ferrand (F), 5-7 juin 1996, Hermès, pp. 17-31.

22. Jean-Marc Petit, Jean-Francois Boulicaut, Farouk Toumani, Jean Beney, Frederic Raphael, Jacques Kouloumdjian. Audit d'une base de données relationnelle par une méthode originale de rétro-conception. Actes des Huitiemes Journées « Le Genie Logiciel et ses applications », Paris, 15-17 novembre 1995, pp. 427-438.

23. Christophe Rigotti, Jean-Francois Boulicaut, Mohand Saïd Hacid. Vers une typologie des sémantiques opérationnelles des extensions objet de Prolog. Actes des 3° Journees Francophones de Programmation Logique JFPL'94, Bordeaux (F), 25-27 mai 1994, pp. 223-237.

24. Christophe Rigotti, Mohand S. Hacid, Jean-Francois Boulicaut. Une approche multi-paradigmes pour tester la coherence d’applications BDOO. Actes des 10° journées « Bases de Données Avancées » BDA'94, Clermont-Ferrand (F), 30 août -2 septembre 1994, pp. 55-74.

25. Jean-Marc Petit, Farouk Toumani, Jacques Kouloumdjian, Jean-Francois Boulicaut. DREAM : une méthode d'analyse pour la rétro-conception de bases de données. Actes des journées d'étude « Ingénierie des Bases de Données : migration, intégration et évolution », Paris, 21-22 septembre 1994, AFCET Ed., pp. 21-30.

26. Jean-Francois Boulicaut. Introduction à une programmation grammaticale à large spectre. Actes des Journées GROPLAN-GDR Programmation Avancée et Outils de l'Intelligence Artificielle, Nancy (F), 18-19 mars 1992, (P. Lescanne & P. Sallé Eds.), pp. 27-42.

27. Alexandre S. Saidi, Jean-Francois Boulicaut. AFFLOG : une implantation de grammaires à deux niveaux pour l'étude de la programmation grammaticale logique. Actes du Séminaire de Programmation Logique du CNET SPLT 90, (S. Bourgault & M. Dincbas Eds.), Trégastel (F), 16-18 mai 1990, pp. 45-70.

28. Jean-Francois Boulicaut, Jean Beney. Métacompilation et Programmation : des règles méthodologiques pour fiabiliser la construction de programmes. Génie Logiciel et Systèmes Experts, n°11, avril 1988, pp. 38-48.

29. Jean Beney, Jean-Francois Boulicaut. STARLET : Un langage pour une programmation logique fiable. Actes du séminaire de Programmation Logique du CNET SPLT 86, Trégastel (F), 21-23 mai 1986, (S. Bourgault & M. Dincbas Eds.), pp. 253-267.

30. Jean Beney, Jean-Francois Boulicaut. Des spécifications grammaticales à la programmation logique: le compromis STARLET. Actes Journées AFCET « Nouveaux Langages pour le Génie Logiciel », 28-29 octobre 1985, Evry (F), BIGRE+GLOBULE 45, pp. 81-88.

Unpublished (though interesting ;-) research reports

1. Jean-Francois Boulicaut, Patrick Marcel, Christophe Rigotti. Using a database query language to specify and generate spreadsheets. Research Report INSA Lyon, July 2000, 10 pages.

2. Jean-Francois Boulicaut, Artur Bykowski, and Baptiste Jeudy. Mining association rules with negations. Research Report INSA Lyon, November 2000, 23 pages. This is an extended version of our FQAS'00 paper.

3. Bruno Cremilleux, Jean-Francois Boulicaut. Delta-strong classification rules for characterizing chemical carcinognens. Research Report INSA Lyon, January 2002. 8 pages.

Updated on January 27, 2010