๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The parameterization reduction of soft sets and its applications

โœ Scribed by Degang Chen; E.C.C. Tsang; Daniel S. Yeung; Xizhao Wang

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
572 KB
Volume
49
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this paper, we focus our discussion on the parameterization reduction of soft sets and its applications. First we point out that the results of soft set reductions offered in [1] are incorrect. We also observe that the algorithms used to first compute the reduct-soft-set and then to compute the choice value to select the optimal objects for the decision problems in [1] are not reasonable and we illustrate this with an example. Finally, we propose a reasonable definition of parameterization reduction of soft sets and compare it with the concept of attributes reduction in rough sets theory. By using this new definition of parameterization reduction, we improve the application of a soft set in a decision making problem found in [1].

๐Ÿ“œ SIMILAR VOLUMES

The normal parameter reduction of soft s
The normal parameter reduction of soft sets and its algorithm
โœ Zhi Kong; Liqun Gao; Lifu Wang; Steven Li ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 590 KB

## a b s t r a c t This paper is concerned with the reduction of soft sets and fuzzy soft sets. Firstly, the problems of suboptimal choice and added parameter set of soft sets are analyzed. Then, we introduce the definition of normal parameter reduction in soft sets to overcome these problems. In a

The utility efficient set and its intera
The utility efficient set and its interactive reduction
โœ Sixto Rios-Insua; Alfonso Mateos ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 789 KB

We assume a decision situation under risk with incomplete information on preferences modelled as a vector utility function. We consider an additive aggregation of its components and partial information on the scaling constants. We develop the concept of utility efficiency to identify efficient strat

Reduction method for concept lattices ba
Reduction method for concept lattices based on rough set theory and its application
โœ Min Liu; Mingwen Shao; Wenxiu Zhang; Cheng Wu ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 625 KB

Rough set theory and formal concept analysis are two complementary mathematical tools for data analysis. In this paper, we study the reduction of the concept lattices based on rough set theory and propose two kinds of reduction methods for the above concept lattices. First, we present the sufficient