TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 11201

Constraint Programming meets Machine Learning and Data Mining

( May 15 – May 20, 2011 )


Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/11201

Organizers

Coordinator

Contact


Schedule

Summary

Over the past two decades the fields of constraint programming, machine learning and data mining have become well-established research fields within computer science. They have contributed many foundational techniques that are routinely applied in real-life scientific and industrial applications. At the same time, awareness has grown that constraints can be very useful during mining and learning, and also that machine learning and data mining may allow one to automatically acquire constraints from data.

Both the data mining and machine learning communities have been interested in constraint-based mining and learning, that is, the use of constraints to formalize mining and learning problems. Examples are the specification of desirable properties of patterns to be mined, or clusters to be found. The task of the data mining or machine learning system is to generate all patterns or to compute the optimal clustering satisfying the constraints. A wide variety of constraints for local pattern mining, clustering and other machine learning problems exist and they have been implemented in an even wider range of specific data mining and machine learning systems for supporting such constraints. Some of these methods are based on mathematical programming techniques, such as linear programming or quadratic programming; other problems, however, cannot be modeled using these techniques. So far, the machine learning and data mining communities have been unable to develop general solvers that are applicable to a wide range of machine learning and data mining problems.

On the other hand, the artificial intelligence community has studied several types of constraint-satisfaction solvers. The most general systems are now gathered in the area of constraint programming. In constraint programming, the user specifies the model, that is, the set of constraints to be satisfied and constraint solvers generate solutions. Thus, the goals of constraint programming and constraint based mining and learning are similar; it is only that constraint programming targets any type of constraint satisfaction problem, whereas constraint-based mining and learning specifically targets data mining and machine learning applications. Therefore, it is surprising that despite the similarities between these two endeauvours, the two fields have evolved independently of one another, and also, that -- with a few recent exceptions -- constraint programming tools and techniques are not yet applied to data mining and machine learning, and, vice versa, that problems and challenges from data mining and machine learning have not yet been taken up by the constraint programming community. Exploring the possibilities for exploiting constraint programming in data mining and machine learning was one goal of this seminar.

The second goal was to study the use of machine learning and data mining in constraint programming. Practitioners of constraint programming have to formulate explicitly the constraints that underly their application. This is often a difficult task. Even when the right constraints are known, it can be challenging to formalize them in such a way that the constraint programming system can use them efficiently. This raises the question as to whether it is possible to (semi)- automatically learn such constraints or their formulations from data and experience. Again, some initial results in this direction exist, but we are away from a complete understanding of the potential of this approach.

In this seminar, we aimed at bridging the gap between these two fields by investigating, on the one hand, how standard constraint-programming techniques can be used in data mining and machine learning, and on the other hand, how machine learning and data mining can contribute to constraint programming. Therefore, this workshop brought together researchers in the areas of constraint programming, machine learning and data mining to discuss these issues, to identify interesting opportunities and challenges for research, and to consolidate and strengthen a promising line of research.


Participants
  • Rolf Backofen (Universität Freiburg, DE) [dblp]
  • Roberto Bayardo (Google Inc. - Mountain View, US)
  • Michele Berlingerio (CNR - Pisa, IT)
  • Hendrik Blockeel (KU Leuven, BE) [dblp]
  • Jean-François Boulicaut (INSA - Lyon, FR) [dblp]
  • Maurice Bruynooghe (KU Leuven, BE)
  • Toon Calders (TU Eindhoven, NL) [dblp]
  • Bruno Crémilleux (Caen University, FR) [dblp]
  • James Cussens (University of York, GB) [dblp]
  • Ian Davidson (University of California - Davis, US) [dblp]
  • Tijl De Bie (University of Bristol, GB) [dblp]
  • Luc De Raedt (KU Leuven, BE) [dblp]
  • Yves Deville (University of Louvain, BE) [dblp]
  • Pierre Dupont (UC Louvain, BE)
  • Pierre Flener (Uppsala University, SE) [dblp]
  • Paolo Frasconi (University of Florence, IT) [dblp]
  • Alan Frisch (University of York, GB) [dblp]
  • Carmen Gervet (German University in Cairo, EG)
  • Bart Goethals (University of Antwerp, BE)
  • Tias Guns (KU Leuven, BE) [dblp]
  • Georgiana Ifrim (University College Cork, IE) [dblp]
  • Kristian Kersting (Fraunhofer IAIS - St. Augustin, DE) [dblp]
  • Arnaud Lallouet (Caen University, FR)
  • Pat Langley (Arizona State University - Tempe, US) [dblp]
  • Laurent Michel (University of Connecticut - Storrs, US) [dblp]
  • Sandy Moens (University of Antwerp, BE)
  • Siegfried Nijssen (KU Leuven, BE & Leiden University, NL) [dblp]
  • Barry O'Sullivan (University College Cork, IE) [dblp]
  • Dan Roth (University of Illinois - Urbana-Champaign, US) [dblp]
  • Salvatore Ruggieri (University of Pisa, IT) [dblp]
  • Christian Schulte (KTH Royal Institute of Technology, SE) [dblp]
  • Michele Sebag (LIMSI - Orsay, FR) [dblp]
  • Arno Siebes (Utrecht University, NL) [dblp]
  • Helmut Simonis (University College Cork, IE) [dblp]
  • Jon Sneyers (KU Leuven, BE)
  • Guido Tack (KU Leuven, BE) [dblp]
  • Pascal Van Hentenryck (Brown University - Providence, US) [dblp]
  • Peter Van Roy (University of Louvain, BE) [dblp]
  • Christel Vrain (University of Orleans, FR) [dblp]
  • Toby Walsh (Data61 / NICTA - Sydney, AU) [dblp]

Related Seminars
  • Dagstuhl Seminar 14411: Constraints, Optimization and Data (2014-10-05 - 2014-10-10) (Details)

Classification
  • Artificial Intelligence
  • Algorithms
  • Programming Languages

Keywords
  • Data mining
  • machine learning
  • constraint programming
  • constraint satisfaction