Attribute value reduction in variable precision rough set
Nian Fu-zhong, Li Ming
Abstract
Nian Fu-zhong, Li Ming
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
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