La verificación estructural de sistemas basados en conocimiento.
Text retrieval using Latent Semantic Indexing (LSI) with truncated Singular Value Decomposition (SVD) has been intensively studied in recent years. However, the expensive complexity involved in computing truncated SVD constitutes a major drawback of the LSI method. In this paper, we demonstrate how matrix rank approximation can influence the effectiveness of information retrieval systems. Besides, we present an implementation of the LSI method based on an eigenvalue analysis for rank approximation...
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.
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 rules...
Updating probabilities by information from only one hypothesis and thereby ignoring alternative hypotheses, is not only biased but leads to progressively imprecise conclusions. In psychology this phenomenon was studied in experiments with the “pseudodiagnosticity task”. In probability logic the phenomenon that additional premises increase the imprecision of a conclusion is known as “degradation”. The present contribution investigates degradation in the context of second order probability distributions....
A new information system representation, which inherently represents indiscernibility is presented. The basic structure of this representation is a Binary Decision Diagram. We offer testing results for converting large data sets into a Binary Decision Diagram Information System representation, and show how indiscernibility can be efficiently determined. Furthermore, a Binary Decision Diagram is used in place of a relative discernibility matrix to allow for more efficient determination of the discernibility...
In this paper the execution of Fuzzy Knowledge Bases in the truth space is briefly analyzed. The computational efficiency of the process is significantly increased by means of a parameterized description based on the linguistic truth values described by Baldwin. This permits executing the Fuzzy Knowledge Base through operations involving only simple numerical values, thus avoiding the direct analytic manipulation of possibility distributions. A Petri Net-based formalism that permits representing...
A new similarity measure for objects that are represented by feature vectors of fixed dimension is introduced. It can simultaneously deal with numeric and symbolic features. Also, it can tolerate missing feature values. The similarity measure between two objects is described in terms of the similarity of their features. IF-THEN rules are being used to model the individual contribution of each feature to the global similarity measure between a pair of objects. The proposed similarity measure is based...