DPM 2011 - International Workshop on Declarative Pattern Mining

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