Constraint Programming for Multi-criteria Conceptual Clustering - Archive ouverte HAL Access content directly
Conference Papers Year :

Constraint Programming for Multi-criteria Conceptual Clustering


A conceptual clustering is a set of formal concepts (i.e., closed itemsets) that defines a partition of a set of transactions. Finding a conceptual clustering is an N P-complete problem for which Constraint Programming (CP) and Integer Linear Programming (ILP) approaches have been recently proposed. We introduce new CP models to solve this problem: a pure CP model that uses set constraints, and an hybrid model that uses a data mining tool to extract formal concepts in a preprocessing step and then uses CP to select a subset of formal concepts that defines a partition. We compare our new models with recent CP and ILP approaches on classical machine learning instances. We also introduce a new set of instances coming from a real application case, which aims at extracting setting concepts from an Enterprise Resource Planning (ERP) software. We consider two classic criteria to optimize, i.e., the frequency and the size. We show that these criteria lead to extreme solutions with either very few small formal concepts or many large formal concepts, and that compromise clusterings may be obtained by computing the Pareto front of non dominated clusterings.
Fichier principal
Vignette du fichier
main.pdf (481.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01544239 , version 1 (21-06-2017)


  • HAL Id : hal-01544239 , version 1


Maxime Chabert, Christine Solnon. Constraint Programming for Multi-criteria Conceptual Clustering. 23rd International Conference on Principles and Practice of Constraint Programming (CP), Aug 2017, Melbourne, Australia. pp.460-476. ⟨hal-01544239⟩
154 View
319 Download


Gmail Facebook Twitter LinkedIn More