2009 Ninth IEEE International Conference on Data Mining Argumentation Based Constraint Acquisition Miami, Florida December 06-December 09 ISBN: 978-0-7695-3895-2
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2009.62
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.
Index Terms:
argumentation, constrains, knowledge acquisition
Citation:
Kostyantyn Shchekotykhin, Gerhard Friedrich, "Argumentation Based Constraint Acquisition," icdm, pp.476-482, 2009 Ninth IEEE International Conference on Data Mining, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||