Skip to Main content Skip to Navigation
Conference papers

Constraint Programming for Mining n-ary Patterns

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.
Complete list of metadatas
Contributor : Greyc Référent <>
Submitted on : Monday, June 30, 2014 - 4:53:27 PM
Last modification on : Tuesday, February 26, 2019 - 6:06:03 PM
Document(s) archivé(s) le : Tuesday, September 30, 2014 - 4:05:20 PM


Files produced by the author(s)


  • HAL Id : hal-01016652, version 1


Medhi Khiari, Patrice Boizumault, Bruno Crémilleux. Constraint Programming for Mining n-ary Patterns. Int. Conference on Principles and Practice of Constraint Programming (CP'10), Sep 2010, St Andrews, Scotland, France. pp.552-­567. ⟨hal-01016652⟩



Record views


Files downloads