Liu Qiong-sun
Abstract
This paper discusses the attribute reduction in Rough Set theory.A new attributre reduction is given in the base of a new kind of attribute significance and the feasibility of the algorithm is validated.finally by attribute relativity analysis,a new algorithm is given.
OpenAlex reports 1 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.
This paper discusses the attribute reduction in Rough Set theory.A new attributre reduction is given in the base of a new kind of attribute significance and the feasibility of the algorithm is validated.finally by attribute relativity analysis,a new algorithm is given.
Key concepts: Rough set, Computer science, Reduction (mathematics), Attribute domain, Algorithm, Set (abstract data type), Base (topology), Theory of relativity