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:
“no little brass rollers
and small easy wheels on the bottom—
my townspeople what are you thinking of!
A rough plain hearse then
with gilt wheels and no top at all.”
—William Carlos Williams (1883–1963)
“[My mother told me:] “You must decide whether you want to get married someday, or have a career.”... I set my sights on the career. I thought, what does any man really have to offer me?”
—Annie Elizabeth Delany (b. 1891)