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:
“We approached the Indian Island through the narrow strait called “Cook.” He said, “I ‘xpect we take in some water there, river so high,—never see it so high at this season. Very rough water there, but short; swamp steamboat once. Don’t paddle till I tell you, then you paddle right along.” It was a very short rapid. When we were in the midst of it he shouted “paddle,” and we shot through without taking in a drop.”
—Henry David Thoreau (1817–1862)
“There is one thing that matters—to set a chime of words tinkling in the minds of a few fastidious people.”
—Logan Pearsall Smith (1865–1946)