Displaying similar documents to “How to secure a high quality knowledge base in a rulebased system with uncertainty”

From ignorance to uncertainty: a conceptual analysis

Pietro Baroni, Giovanni Guida, Silvano Mussi (1998)

Kybernetika

Similarity:

This paper aims to develop an analysis of how ignorance affects the reasoning activity and is related to the concept of uncertainty. With reference to a simple inferential reasoning step, involving a single piece of relational knowledge, we identify four types of ignorance and show how they give rise to different types of uncertainty. We then introduce the concept of reasoning attitude, as a basic choice about how reasoning should be carried out in presence of ignorance. We identify...

The HeKatE methodology. Hybrid engineering of intelligent systems

Grzegorz J. Nalepa, Antoni Ligęza (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper describes a new approach, the HeKatE methodology, to the design and development of complex rule-based systems for control and decision support. The main paradigm for rule representation, namely, eXtended Tabular Trees (XTT), ensures high density and transparency of visual knowledge representation. Contrary to traditional, flat rule-based systems, the XTT approach is focused on groups of similar rules rather than on single rules. Such groups form decision tables which are connected...

Linguistic knowledge base simplification regarding accuracy and interpretability.

José M. Alonso, Luis Magdalena, Serge Guillaume (2006)

Mathware and Soft Computing

Similarity:

This work proposes a new method in order to simplify linguistic knowledge bases. The main goal consists of improving simultaneously accuracy and interpretability when it is possible, or at least ensuring a good trade-off between them, as well as consistency of the final knowledge base. It is used with linguistic rules which can be defined by expert, induced by data, or both of them. The simplification process is applied to the well known wine classification problem. The results are encouraging. ...

Designing a Semantic Ground Truth for Mathematical Formulae

Sexton, Alan, Sorge, Volker, Suzuki, Masakazu

Similarity:

We report on a new project to design a semantic ground truth set for mathematical document analysis. The ground truth set will be generated by annotating recognised mathematical symbols with respect to both their global meaning in the context of the considered documents and their local function within the particular mathematical formula they occur. The aim of our work is to have a reliable database available for semantic classification during the formula recognition process with the...

Mining indirect association rules for web recommendation

Przemysław Kazienko (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

Classical association rules, here called “direct”, reflect relationships existing between items that relatively often co-occur in common transactions. In the web domain, items correspond to pages and transactions to user sessions. The main idea of the new approach presented is to discover indirect associations existing between pages that rarely occur together but there are other, “third” pages, called transitive, with which they appear relatively frequently. Two types of indirect associations...

Contexts, locality and generality.

Paolo Bouquet, Enrico Giunchiglia, Fausto Giunchiglia (1996)

Mathware and Soft Computing

Similarity:

It has been recognized that AI programs suffer from a lack of generality, the first gross symptom being that a small variation to the problem being solved usually causes a major revision of the theory describing it. The lack of generality seems an unavoidable consequence of the process of approximating the world while building theories about it. In this paper we propose an approach where generality is achieved by formulating, for each problem at hand, an appropriate local theory, a theory...