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:
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 CyberChair. Paper submissions should be from 6 to 8 pages long 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.
Important dates
July 23, 2011 August 5, 2011 (extended deadline) : Due date for full workshop papers
September 20, 2011: Notification of paper acceptance to authors
October 11, 2011: Camera-ready of accepted papers
December 11, 2011: Workshop date
Organizers
-
Raoul Medina (Université Blaise Pascal, Clermont-Ferrand, France)
-
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 Goethals, 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)
Lakhdar Sais, Université d'Artois (France)
Thomas Schiex, INRA Toulouse (France)
Takeaki Uno, National Insitute of Informatics (Japan)
Jef Wijsen, Université de Mons (Belgium)
Workshop program
The workshop will be held on Dec. 11, 2011, from 8am to 12am.
8:15-8:30: Foreword – Hiroki Arimura, Raoul Médina, Jean-Marc Petit
8:30-9:00: Declarative Heuristic Search for Pattern Set Mining, Tias Guns, Siegfried Nijssen, Albrecht Zimmermann, and Luc De Raedt
9:00-9:30: A Constraint-based Language for Declarative Pattern Discovery, Jean-Philippe Métivier, Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, and Samir Loudni
9:30-10:00: A Constraint Programming Approach for Enumerating Motifs in a Sequence, Emmanuel Coquery, Saïd Jabbour, and Lakhdar Saïs
10:30-11h00: Constraint-based Pattern Mining in Multi-Relational Databases, Siegfried Nijssen, Tias Guns, and Aida Jimenez
11h-11:30: Mining of EL-GCIs, Daniel Borchmann and Felix Distel
11:30-12:00: CLIM : CLosed Inclusion dependency Mining in databases, Fabien De Marchi
Connection