In this article, we generalize Pawlak's rough approach for simplifying the decision table in an information system. We consider an information system where attribute values are not always quantitative, but are rather subjective, having vague or imprecise meanings. Some objects may have attribute val
Generalized rough approach to reduction of a decision table
โ Scribed by Shrabonti Ghosh; S. S. Alam
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 80 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
โฆ Synopsis
In this article, Pawlak's rough approach for simplifying a decision table in an information system has been generalized. An information system has been considered in which attribute values are not always quantitative, but rather subjective, having vague or imprecise meanings. Some objects may have attribute values that are almost identical, i.e., they cannot be distinguished clearly by the attributes. Considering this observation, a generalized method has been proposed for reduction of a decision table for different choice values of โฃ and โค, โฃ being for condition attributes and โค for decision attributes where โฃ, โค สฆ [0, 1]. For โฃ ฯญ 1 and โค ฯญ 1, the method reduces to Pawlak's method. However, for โฃ ฯฝ 1 and โค ฯฝ 1, the proposed method is more flexible than Pawlak's method.
๐ SIMILAR VOLUMES
## Abstract For Abstract see ChemInform Abstract in Full Text.
For fixed positive integer k, let E n denote the set of lattice paths using the steps 1 1 , 1 -1 , and k 0 and running from 0 0 to n 0 while remaining strictly above the x-axis elsewhere. We first prove bijectively that the total area of the regions bounded by the paths of E n and the x-axis satisfi
## Abstract For Abstract see ChemInform Abstract in Full Text.