Constraint Acquisition via Partial Queries

Abstract : We learn constraint networks by asking the user partial queries. That is, we ask the user to classify assignments to subsets of the variables as positive or negative. We provide an algorithm that, given a negative example, focuses onto a constraint of the target network in a number of queries logarithmic in the size of the example. We give information theoretic lower bounds for learning some simple classes of constraint networks and show that our generic algorithm is optimal in some cases. Finally we evaluate our algorithm on some benchmarks.
Type de document :
Communication dans un congrès
IJCAI: International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. 23rd International Joint Conference on Artificial Intelligence, 2013
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00830325
Contributeur : Joël Quinqueton <>
Soumis le : mardi 4 juin 2013 - 16:52:25
Dernière modification le : mardi 16 octobre 2018 - 01:13:05
Document(s) archivé(s) le : mardi 4 avril 2017 - 16:53:03

Fichier

ijcai13-quacq.pdf
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : lirmm-00830325, version 1

Citation

Christian Bessière, Remi Coletta, Emmanuel Hébrard, George Katsirelos, Nadjib Lazaar, et al.. Constraint Acquisition via Partial Queries. IJCAI: International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. 23rd International Joint Conference on Artificial Intelligence, 2013. 〈lirmm-00830325〉

Partager

Métriques

Consultations de la notice

831

Téléchargements de fichiers

410