Improved Attribute Reduction Algorithm Based on Discernibility Matrix
He Le
Abstract
He Le
Abstract
This paper discusses the problem of attribute reduction according to rough set theory,and proposes one improved attribute reduction algorithm based on the traditional discernibility matrix.First,the discernibility matrix is constructed according to the decision table.Then,the items containing core and fake core are deleted from the discernibility matrix.Finally,the reduction result is obtained by simplifying the remaining items of the discernibility matrix.This paper verifies the effectiveness of the algorithm by processing engine failure data.
A significance statement is not available in the OpenAlex record.
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.
This paper discusses the problem of attribute reduction according to rough set theory,and proposes one improved attribute reduction algorithm based on the traditional discernibility matrix.First,the discernibility matrix is constructed according to the decision table.Then,the items containing core and fake core are deleted from the discernibility matrix.Finally,the reduction result is obtained by simplifying the remaining items of the discernibility matrix.This paper verifies the effectiveness of the algorithm by processing engine failure data.
Key concepts: Rough set, Decision table, Reduction (mathematics), Matrix (chemical analysis), Algorithm, Core (optical fiber), Set (abstract data type), Mathematics