2005Unpublished venueRequires access

Attribute value reduction in variable precision rough set

Nian Fu-zhong, Li Ming

Open publisher page 2 citations

Abstract

As far as a specific rule is concerned, attribute reduction is equivalent to attribute value reduction. Especially for variable precision rough set (VPRS) , any attribute value may be a value reduct, every of them must be checked. Some important information would be ignored if we still first compute attribute reduct and then compute its value reduct just as traditional Rough set theory (RST) in VPRS. This paper, through analyzing the nature of reduction, and the specific meanings of value reduction in VPRS, provide a direct value reduction algorithm.

About this research paper

What this paper is about

As far as a specific rule is concerned, attribute reduction is equivalent to attribute value reduction. Especially for variable precision rough set (VPRS) , any attribute value may be a value reduct, every of them must be checked. Some important information would be ignored if we still first compute attribute reduct and then compute its value reduct just as traditional Rough set theory (RST) in VPRS. This paper, through analyzing the nature of reduction, and the specific meanings of value reduction in VPRS, provide a direct value reduction algorithm.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

As far as a specific rule is concerned, attribute reduction is equivalent to attribute value reduction. Especially for variable precision rough set (VPRS) , any attribute value may be a value reduct, every of them must be checked. Some important information would be ignored if we still first compute attribute reduct and then compute its value reduct just as traditional Rough set theory (RST) in VPRS. This paper, through analyzing the nature of reduction, and the specific meanings of value reduction in VPRS, provide a direct value reduction algorithm.

Key concepts: Reduct, Rough set, Reduction (mathematics), Attribute domain, Data mining, Value (mathematics), Mathematics, Variable and attribute

Related papers

Back to paper searchBrowse research topicsOriginal source
Attribute value reduction in variable precision rough set — Research Paper | ScholarLens