Constraint programming for mining n-ary patterns

  • Authors:
  • Mehdi Khiari;Patrice Boizumault;Bruno Crémilleux

  • Affiliations:
  • GREYC, CNRS, UMR, Université de Caen Basse-Normandie, Caen Cedex, France;GREYC, CNRS, UMR, Université de Caen Basse-Normandie, Caen Cedex, France;GREYC, CNRS, UMR, Université de Caen Basse-Normandie, Caen Cedex, France

  • Venue:
  • CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The aim of this paper is to model and mine patterns combining several local patterns (n-ary patterns). First, the user expresses his/her query under constraints involving n-ary patterns. Second, a constraint solver generates the correct and complete set of solutions. This approach enables to model in a flexible way sets of constraints combining several local patterns and it leads to discover patterns of higher level. Experiments show the feasibility and the interest of our approach.