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

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


Reduction of the decision table: A rough
โœ Shrabonti Ghosh; Ranjit Biswas; S. S. Alam ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 70 KB

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

A Generic Approach for the Catalytic Red
โœ Stephen Caddick; Duncan B. Judd; Alexandra K. de K. Lewis; Melanie T. Reich; Mer ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons โš– 129 KB ๐Ÿ‘ 2 views

## Abstract For Abstract see ChemInform Abstract in Full Text.

A Bijective Approach to the Area of Gene
โœ E. Pergola; R. Pinzani; S. Rinaldi; R.A. Sulanke ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 105 KB

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