Skip to main content

Program - June 2008

Thursday, June 12th, 2008


  • introduction
  • synthesis of the work according to each partner
  • constraint satisfaction problem for constraint-based pattern mining (Mehdi Khiari, GREYC)
  • kernel similarities on graphs (Bertrand Cuissart, GREYC)
  • inventory of knowledge nuggest available in web mining (François Jacquenet, LaHC)
  • coordinators: half-yearly reports and Delivrable 1

Friday, June 13th, 2008
  • 9:15 Data_Peeler: constraint-based closed pattern mining in n-ary relations / Extraction sous contraintes de motifs fermés dans des relations n-aires - Abstract (Loïc Cerf, LIRIS)
  • 9:55 Elagage efficace d'automates probabilistes - Abstract (Baptiste Jeudy et Franck Thollard, LaHC)
  • 10:35 break

  • 11:00 A lower bound on the number of examples needed to perform a significant sequence mining task - Abstract (Marc Sebban, LaHC)
  • synthesis and work-plan

Room S3-305
UFR Sciences - Université de Caen
Boulevard du Maréchal Juin
14000 Caen
Tramway: line A, direction Campus 2, get off at the last stop
Maps are available at: