Argumentation based constraint acquisition

27Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Efficient acquisition of constraint networks is a key factor for the applicability of constraint problem solving methods. Current techniques learn constraint networks from sets of training examples, where each example is classified as either a solution or non-solution of a target network. However, in addition to this classification, an expert can usually provide arguments as to why examples should be rejected or accepted. Generally speaking domain specialists have partial knowledge about the theory to be acquired which can be exploited for knowledge acquisition. Based on this observation, we discuss the various types of arguments an expert can formulate and develop a knowledge acquisition algorithm for processing these types of arguments which gives the expert the possibility to input arguments in addition to the learning examples. The result of this approach is a significant reduction in the number of examples which must be provided to the learner in order to learn the target constraint network. © 2009 IEEE.

Cite

CITATION STYLE

APA

Shchekotykhin, K., & Friedrich, G. (2009). Argumentation based constraint acquisition. In Proceedings - IEEE International Conference on Data Mining, ICDM (pp. 476–482). https://doi.org/10.1109/ICDM.2009.62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free