Representing Arguments as Background Knowledge for Constraining Generalisation
نویسنده
چکیده
The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and against a hypothesis rather than as statements in logic or probabilistic relations, and show how it can be used to constrain generalisation from single examples (sometimes referred to as`case-based reasoning'). Examples are characterised by the set of arguments for and against a hypothesis of interest, and the resolution of connicting arguments in a current problem is obtained by rstly locating an old example where the same or a similar connict occurred, then secondly generalising the solution in the old example to also apply to the new problem. This allows learning to occur in domains where few training examples exist and background knowledge is available. We provide a description of this method in logical form, and analyse the assumptions under which it is valid, its limitations and possible future extensions.
منابع مشابه
Representing Arguments as Background Knowledge for Constraining Gereralisation
The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...
متن کاملRepresenting Arguments as Background Knowledge for the Justiication of Case-based Inferences
This paper examines the representation of background knowledge and its use in case-based reasoning. Case-based reasoning can be viewed as a particular form of problem-solving, based on the assessment of similarity of a new case to previously encountered cases, and the subsequent inference that an old solution also applies to the new case. To justify such inferences, we present a representation ...
متن کاملAn Abstraction-based Machine Learning Approach to Cartographic Generalisation
This article proposes a machine learning approach to overcome the knowledge acquisition bottleneck limiting the automation of cartographic generalisation. It first explains why this automation must be guided by a differentiation of two main types of knowledge involved in this process. More precisely, it shows that cartographic generalisation is best viewed as a combination of two processes: rep...
متن کاملLearning Abstraction and Representation Knowledge: an Application to Cartographic Generalisation
This article proposes a machine learning approach to overcome the knowledge acquisition bottleneck that limits the automation of cartographic generalisation. It first explains why this automation must be guided by a differentiation of two main types of knowledge involved in this process. More precisely, it shows that cartographic generalisation can be accomplished by a combination of two proces...
متن کاملValid Attacks in Argumentation Frameworks with Recursive Attacks
The purpose of this work is to study a generalisation of Dung’s abstract argumentation frameworks that allows representing recursive attacks, that is, a class of attacks whose targets are other attacks. We do this by developing a theory of argumentation where the classic role of attacks in defeating arguments is replaced by a subset of them, which is extension dependent and which, intuitively, ...
متن کامل