I am associate professor in computer science at INSA-Lyon (National Institute of Applied Science).

Research interests

My research work is to design efficient constraint-based data mining algorithms for 0/1 data and dynamic graph analysis. I defended my PhD thesis in 2002, presenting a co-clustering mining algorithm. During the following year, I had a post-doctoral position at INRIA on using association rules and clustering techniques on gene expression data. I co-supervised, with Jean-François Boulicaut, the PhD thesis of Ruggero Pensa (defended in December 2006) entitled A generic framework for constraint-based co-clustering: application to transciptomic analysis. I also worked with Jérémy Besson during his PhD on the extraction of formal concepts and fault-tolerant patterns in 0-1 data, and with Loïc Cerf on constraint-based closed pattern mining in n-ary relations. In 2008, I spent 6 months in Bart Goethals group as research fellow at Antwerp University (Belgium). I worked on inductive databases prototyping, mining sets in sequences and constraint-based subspace clustering. The following year, I had a delegate position at INRIA in the D-net team to work on the analysis of dynamic graphs.

I recently worked on the following research projects: