Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix
In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method. |
---|---|
DOI: | 10.1109/CINC.2009.212 |