论文信息 - Learning in Knowledge Based System, a Possibilistic Approach

Learning in Knowledge Based System, a Possibilistic Approach

Let us now make the final conclusions concerning the learning process by examples based on the concepts of a possibility distribution function and a rough set. As was shown the interpretation JS has the power of reducing the uncertainty whether an element belongs or does not belong to a concept to be learned. This is an improvement over the interpretation MS which can not provide any information for elements in the boundary. It can be observed that the computed function GS gets closer to the interpretation JS as the number of the learned concepts grows larger. The measure of learning defined by us reflects the effect of arranging the set of concepts to be learned into a particular sequence. The optimization method that we have outlined can be used to improve the learning process.

Zbigniew W. Ras | Maria Zemankova

[1] Bruce G. Buchanan,et al. Principles of Rule-Based Expert Systems , 1982, Adv. Comput..

[2] Zbigniew W. Ras,et al. Rough-sets based learning systems , 1984, Symposium on Computation Theory.

[3] Zdzislaw Pawlak,et al. Information systems theoretical foundations , 1981, Inf. Syst..

[4] Ryszard S. Michalski,et al. A Theory and Methodology of Inductive Learning , 1983, Artificial Intelligence.

[5] D. Bobrow,et al. Representation and Understanding: Studies in Cognitive Science , 1975 .

[6] P. Winston. Learning by Augmenting Rules and Accumulating Censors. , 1982 .

[7] Patrick Henry Winston,et al. Learning structural descriptions from examples , 1970 .

[8] Janice S. Aikins,et al. Prototypical Knowledge for Expert Systems , 1983, Artif. Intell..

[9] Thomas G. Dietterich,et al. Inductive Learning of Structural Descriptions: Evaluation Criteria and Comparative Review of Selected Methods , 1981, Artif. Intell..