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:
“What we have found in this country, and maybe we’re more aware of it now, is one problem that we’ve had, even in the best of times, and that is the people who are sleeping on the grates, the homeless, you might say, by choice.
I am my brother’s keeper, and he’s sleeping pretty rough these days.”
—Derek, Archbishop Worlock (b. 1920)
“Every woman is supposed to have the same set of motives, or else to be a monster.”
—George Eliot [Mary Ann (or Marian)