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.