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:
“Western hospitality prevails; it is reminiscent of the kind displayed earlier here by a host who said to an unexpected guest, Stranger, you take the wold skin and the chaw o sowbellyIll rough it.”
—Administration in the State of Texa, U.S. public relief program (1935-1943)
“In the lack of judgment great harm arises, but one vote cast can set right a house.”
—Aeschylus (525456 B.C.)