2009Computer Technology and DevelopmentRequires access

An Algorithm of Attribution Reduction of Variable Precision Rough Sets Theory

Wang Bao-tong

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Rough set, Reduction (mathematics), Computer science, Decision table, Algorithm, Variable (mathematics), Field (mathematics), Key (lock)

Related papers

Back to paper searchBrowse research topicsOriginal source
An Algorithm of Attribution Reduction of Variable Precision Rough Sets Theory — Research Paper | ScholarLens