Advances in rough set theory and its appliations
Keyun Hu
Abstract
Keyun Hu
Abstract
Rough set theory, a new mathematical tool dealing with vagueness and uncertainty, was introduced by Pawlak in 1982. It has been widely used in the area of AI, data mining, pattern recognition, fault diagnositics, etc. This paper describes the basic algorithms for rough set theory, including equivalent relation, upper/lower approximation and reduction. Then several extensions of rough set theory are discussed such as VPRS, similarity based model, and applications of rough set theory in areas like data mining, rough logic, etc. Further research directions are then discussed.
OpenAlex reports 4 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.
Rough set theory, a new mathematical tool dealing with vagueness and uncertainty, was introduced by Pawlak in 1982. It has been widely used in the area of AI, data mining, pattern recognition, fault diagnositics, etc. This paper describes the basic algorithms for rough set theory, including equivalent relation, upper/lower approximation and reduction. Then several extensions of rough set theory are discussed such as VPRS, similarity based model, and applications of rough set theory in areas like data mining, rough logic, etc. Further research directions are then discussed.
Key concepts: Rough set, Vagueness, Dominance-based rough set approach, Set theory, Data mining, Relation (database), Set (abstract data type), Reduction (mathematics)