In computer science, a rough set, first described by a 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.
Read more about Rough Set: Definitions, Rule Extraction, Incomplete Data, Applications, Extensions, History
Famous quotes containing the words rough and/or set:
“Graves at my command
Have waked their sleepers, oped, and let ‘em forth
By my so potent art. But this rough magic
I here abjure.”
—William Shakespeare (1564–1616)
“And set off briskly for so slow a thing,
Still going every which way in the joints, though,
So that it looked like lightning or a scribble.”
—Robert Frost (1874–1963)