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:
“Virtue rejects facility to be her companion.... She requires a craggy, rough and thorny way.”
—Michel de Montaigne (1533–1592)
“A wise man should order his interests, and set them all in their proper places. This order is often troubled by greed, which puts us upon pursuing so many things at once that, in eagerness for matters of less consideration, we grasp at trifles, and let go things of greater value.”
—François, Duc De La Rochefoucauld (1613–1680)