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:
“Such is the fate of simple Bard,
On life’s rough ocean luckless starr’d:”
—Robert Burns (1759–1796)
“There is nothing less to our credit than our neglect of the foreigner and his children, unless it be the arrogance most of us betray when we set out to “americanize” him.”
—Charles Horton Cooley (1864–1929)