Loading Icon

Rough set

In computer science, a rough set, first described by Polish computer scientist Zdzisław I. Pawlak, is a formal approximation of a crisp set (i.e., conventional set) in terms of a pair of sets which give the lower and the upper approximation of the original set. In the standard version of rough set theory (Pawlak 1991), the lower- and upper-approximation sets are crisp sets, but in other variations, the approximating sets may be fuzzy sets.

Metrics Summary

Total Publications
Lifetime
12,341
Prior Five Years
2,427
Total Citations
Lifetime
192,083
Prior Five Years
18,319
Total Scholars
Lifetime
11,021
Prior Five Years
8,091

Institutional Rankings

Global (Worldwide)
Show More
National Institutional Rankings

Publications and Citation History

Publications based on Disciplines

Scholars based on Disciplines

Publications based on Fields

Scholars based on Fields

Highly Ranked Scholars™

Lifetime
Prior Five Years

Highly Cited Publications

Lifetime