On numerical characterizations of the topological reduction of incomplete information systems based on evidence theory.

Knowledge reduction of information systems is one of the most important parts of rough set theory in real-world applications. Based on the connections between the rough set theory and the theory of topology, a kind of topological reduction of incomplete information systems is discussed. In this study, the topological reduction of incomplete information systems is characterized by belief and plausibility functions from evidence theory. First, we present that a topological space induced by a pair of approximation operators in an incomplete information system is pseudo-discrete, which deduces a partition. Then, the topological reduction is characterized by the belief and plausibility function values of the sets in the partition. A topological reduction algorithm for computing the topological reducts in incomplete information systems is also proposed based on evidence theory, and its efficiency is examined by an example. Moreover, relationships among the concepts of topological reduct, classical reduct, belief reduct, and plausibility reduct of an incomplete information system are presented. [ABSTRACT FROM AUTHOR]