An improved algorithm for value reduction of attributes in decision tables based on rough set theory
Xuegang Hu
Abstract
Xuegang Hu
Abstract
Attribute reduction and value reduction are two main contents in rough set theory.An improved value reduction algorithm suitable for decision tables,AVRIMC,is presented in this paper.For every row in the discernibility matrix,it utilizes the absorptivity and value core properties as optimization conditions to construct the latter items of this row.Experiment results show that this method is superior to the algorithm in related literature in time consumption.
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.
Attribute reduction and value reduction are two main contents in rough set theory.An improved value reduction algorithm suitable for decision tables,AVRIMC,is presented in this paper.For every row in the discernibility matrix,it utilizes the absorptivity and value core properties as optimization conditions to construct the latter items of this row.Experiment results show that this method is superior to the algorithm in related literature in time consumption.
Key concepts: Rough set, Reduction (mathematics), Decision table, Algorithm, Value (mathematics), Construct (python library), Set (abstract data type), Matrix (chemical analysis)