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:
“Not once or twice in our rough island-story
The path of booty was the way to glory.”
—Anonymous.
“The host, the housekeeper, it is
who fails you. He had forgotten
to make room for you at the hearth
or set a place for you at the table
or leave the doors unlocked for you.”
—Denise Levertov (b. 1923)