Article ID Journal Published Year Pages File Type
9662461 Computers & Mathematics with Applications 2005 7 Pages PDF
Abstract
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].
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , , ,