Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Topology, one of the most important subjects in mathematics, provides mathematical tools and interesting topics in studying information systems and rough sets. In this paper, we present the topological characterizations to three types of covering approximation operators. F...

This paper focuses on generalization of rough set model and rule induction. First a extension of rough set approximations is established on general granular structure, so that the rough set models on some special granular structures are meaningful. The new rough approximation operators are interpreted by topological terminology well. Conversely, by means of the new rough approximation operators...

Rough sets deal with the vagueness and granularity in information systems. Reference[3] discusses rough approximations on a complete completely distributive lattice(CCD lattice for short) and brings generalizations of rough sets into a unified framework. This paper is devoted to the discussion of the relationship between approximations and topologies on a CCD lattice. It is proved that the set ...

Attribute reduction is one of the most important issues and the focus of the research on efficient algorithms in rough sets. This paper focus on the routing selection algorithms and application used to compute QoS routes in OSPF protocol that are based on the rough set, which the attribute-value system about the link of network is created from the network topology. The use of rough set method c...

athemat s.2012.1 Abstract Rough set theory is a powerful mathematical tool for dealing with inexact, uncertain or vague information. The core concept of rough set theory are information systems and approximation operators of approximation spaces. In this paper, we define and investigate three types of lower and upper multiset approximations of any multiset. These types based on the multiset bas...

Granulation and partition are examined in parallel from the rough set prospect. The table representations and concept hierarchy tree for partitions are set theoretical, but become topological for granulations. Here topology means the binary neighborhood system pre-topology defined by binary relations.

Choosing a multiprocessor interconnection topology may depend on high-level considerations, such as the intended application domain and the expected number of processors. It certainly depends on low-level implementation details, such as packaging and communications protocols. We first use rough measures of cost and performance to characterize several topologies. We then examine how implementati...