Attribute Reduction Algorithm Based on Incomplete Decision Table
Yue Du, Jian Wang, Xu Zhang
Abstract
Open-access reader
Yue Du, Jian Wang, Xu Zhang
Abstract
Open-access reader
The paper describes the basic concepts of rough set theory and discernibility matrix and presents an attribute reduction algorithm based on reduced discernibility matrix, which aims at resolving the inadequate of the existing attribute reduction based on incomplete decision table.There only contain useful elements for the algorithm in the reduced discernibility matrix, which obtain one reduction of incomplete decision table by iteration and set operations.The experimental results show that the algorithm can not only obtain reduced attribute, but also reduce the computation time and storage space greatly.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The paper describes the basic concepts of rough set theory and discernibility matrix and presents an attribute reduction algorithm based on reduced discernibility matrix, which aims at resolving the inadequate of the existing attribute reduction based on incomplete decision table.There only contain useful elements for the algorithm in the reduced discernibility matrix, which obtain one reduction of incomplete decision table by iteration and set operations.The experimental results show that the algorithm can not only obtain reduced attribute, but also reduce the computation time and storage space greatly.
Key concepts: Rough set, Decision table, Reduction (mathematics), Algorithm, Matrix (chemical analysis), Table (database), Computation, Set (abstract data type)