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...