Association Française pour la Programmation par Contraintes – Programmation par Contraintes: Décrivez votre problème, laissez les solveurs le résoudre Programmation par Contraintes: Décrivez votre problème, laissez les solveurs le résoudre

Call for Papers : Declarative Pattern Mining Workshop@ICDM2011

*

*

*

IMPORTANT DATES

  • July 23, 2011: Due date for full workshop papers

  • September 20, 2011: Notification of paper acceptance to authors

  • October 11, 2011: Camera-ready of accepted papers

  • December 10, 2011: Workshop date

AIM

State of the art systems and prototypes for data mining offer a quite limited support – if any – for enumeration problems. Their main weakness is at the declarative level; they do not try to push ”declarativity” as a first class citizen and then offer some specialized implementations without any possibility:

  • To easily add (or remove) constraints or

  • To support even slight modifications of the problem statement.

This lack of flexibility and genericity is clearly problematic and induce important efforts on the design and maintenance of data mining systems. The need for declarative and expressive modeling languages with associated generic and efficient solving techniques is clearly an important research agenda.

This workshop aims to explore the cross-fertilization between data mining, artificial intelligence, combinatorial algorithmic and databases to bring original solutions to fundamental data mining problems.

Issues to be addressed include (but are not limited to):

  • High-level declarative languages (logical or algebraic) for expressing interesting complex patterns enumeration problems

  • Complexity and algorithms for complex patterns enumeration problems

  • Modeling complex patterns with itemsets

  • Use cases of complex patterns mining

  • Mining complex patterns using constraint (logic) programming, Satisfiability (modulo theory), Integer Linear programming, …

  • Classification of complex patterns mining problems

  • Coupling Database systems with pattern mining

PAPER SUBMISSION

All submissions will be handled electronically via EasyChair. Paper sub- missions should be limited to a maximum of 8 pages in the IEEE 2-column format. All papers will be reviewed by the program committee on the basis of technical quality, relevance to the workshop topics, originality, significance, and clarity. Papers that do not comply with the Submission Guidelines will be rejected without review.

For paper submission, please use submission system on the website of the workshop: http://liris.cnrs.fr/wdpm2011/

ORGANIZERS

PROGRAM COMMITTEE

  • Franz Baader, TU Dresden (Germany)

  • Jean-François Boulicaut, INSA/Université de Lyon (France)

  • Bruno Crémilleux, Université de Caen (France)

  • Luc de Raedt, Katholieke Universiteit Leuven (Belgium)

  • Khaled Elbassioni, Max-Planck-Institut für Informatik (Germany)

  • Alain Gely, Université Paul Verlaine (France)

  • Bart Goetals, University of Antwerp (Belgium)

  • Sergei Kuznetsov, State University Higher School of Economics (Russia)

  • Dominique Laurent, Université Cergy-Pontoise (France)

  • Hong-Cheu Liu, Taiwan Shoufu University (Taiwan)

  • Joao Marques-Silva, University College Dublin (Ireland)

  • Rokia Missaoui, Université du Québec en Outaouais (Canada)

  • Siegfried Nijssen, Katholieke Universiteit Leuven (Belgium)

  • Lhouari Nourine, Université Blaise Pascal (France)

  • Marie-Christine Rousset, Université de Grenoble (France)

  • Lakdhar Sais, Université d’Artois (France)

  • Thomas Schiex, INRA Toulouse (France)

  • Takeaki Uno, National Institute of Informatics (Japan)

  • Jef Wijsen, Université de Mons (Belgium)


archive

Archive