The introduction of information system homomorphisms has made a substantial contribution to attribute reduction. However, the efforts made on homomorphisms are far from sufficient. This paper further investigates homomorphisms between covering approximation spaces. First, we introduce the concepts of upper and lower homomorphisms as well as homomorphisms in order to study the relationship between covering approximation spaces. Then we present the notions of covering approximation subspaces and product spaces. We also compress covering approximation spaces and covering information systems with the aim of attribute reduction. Afterwards, by utilizing the compressions of the original spaces and systems we compress the dynamic covering approximation spaces and dynamic covering information systems. Several illustrative examples are employed to demonstrate that the homomorphisms provide an effective approach for compressing covering approximation spaces and covering information systems.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In practical situations, interval-valued fuzzy sets are of interest because fuzzy sets of this kind are frequently encountered. In this paper, motivated by the needs for solving imprecise problems, we generalize the concept of shadowed sets for understanding interval-valued fuzzy sets and provide a solution to compute a pair of thresholds by searching for a balance of uncertainty. Then we present three-way approximations of interval-valued fuzzy sets and a formulation for calculating the pair of thresholds using single-valued loss functions. We also compute three-way approximations of interval-valued fuzzy sets using interval-valued loss functions. Afterwards, we employ several examples to illustrate that how to take an action for an object with an interval-valued membership grade using an interval-valued loss function.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.