An Algorithm of Attribution Reduction of Variable Precision Rough Sets Theory
Wang Bao-tong
Abstract
Wang Bao-tong
Abstract
Attribute reduction is one of the key topics in the Rough Set theory field.It has been proved that computing the minimal reduction of decision table is an NP-hard problem.Relative discernibility matrix and attribute significance are considered to solve the attribute reduction of variable precision rough sets theory.Moreover,the improved algorithm of attribution reduction reduction is given.It can simplify the operation and enhance reduction the efficiency of seeking the reduction in some extent.At last,a practical example is given to show the validity of the algorithm.
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 is one of the key topics in the Rough Set theory field.It has been proved that computing the minimal reduction of decision table is an NP-hard problem.Relative discernibility matrix and attribute significance are considered to solve the attribute reduction of variable precision rough sets theory.Moreover,the improved algorithm of attribution reduction reduction is given.It can simplify the operation and enhance reduction the efficiency of seeking the reduction in some extent.At last,a practical example is given to show the validity of the algorithm.
Key concepts: Rough set, Reduction (mathematics), Computer science, Decision table, Algorithm, Variable (mathematics), Field (mathematics), Key (lock)