Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Hi-index | 0.00 |
The rationality of a reduction approach for decision rules with discernibility matrix is analyzed and proved true theoretically. And a rules extraction strategy based on bit-coded discernibility matrix is presented. By bit-coding the description of discernibility matrix, the information is depicted by a series of binary code, which makes it easy to actualize the algorithm on a computer. And then, a hybrid algorithm of rules extraction is presented.That means the attribute and rules reduction work synchronously. The results that is applied for the rules extraction of the cement kiln operation has shown that its efficiency and availability