Approximate Reasoning in Supervised Classification Systems

被引:2
|
作者
Seridi, Hamid [1 ,2 ]
Akdag, Herman [2 ]
Mansouri, Rachid [3 ]
Nemissi, Mohamed [1 ]
机构
[1] Univ 08 Mai 1945 Guelma, LAIG, BP 401, Guelma 24000, Algeria
[2] Univ Reims, LERI, F-51687 Reims 2, France
[3] Univ 08 Mai 1945 Guelma, LGCH, Guelma 24000, Algeria
关键词
qualitative uncertainty; expert systems; symbolic probability; knowledge representation; multivalued logic;
D O I
10.20965/jaciii.2006.p0586
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In knowledge-based systems, uncertainty in propositions can be represented by various degrees of belief encoded by numerical or symbolic values. The use of symbolic values is necessary in areas where the exact numerical values associated with a fact are unknown by experts. In this paper we present an expert system of supervised automatic classification based on a symbolic approach. This last is composed of two subsystems. The first sub-system automatically generates the production rules using training set; the generated rules are accompanied by a symbolic degree of belief which characterizes their classes of memberships. The second is the inference system, which receives in entry the base of rules and the object to classify. Using classical reasoning (Modus Ponens), the inference system provides the membership class of this object with a certain symbolic degree of belief. Methods to evaluate the degree of belief are numerous but they are often tarnished with uncertainty. To appreciate the performances of our symbolic approach, tests are made on the Iris data basis.
引用
收藏
页码:586 / 593
页数:8
相关论文
共 50 条