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:
“What opium is instilled into all disaster? It shows formidable as we approach it, but there is at last no rough rasping friction, but the most slippery sliding surfaces. We fall soft on a thought.”
—Ralph Waldo Emerson (1803–1882)
“And therefore, as when there is a controversy in an account, the parties must by their own accord, set up for right Reason, the Reason of some Arbitrator, or Judge, to whose sentence, they will both stand, or their controversy must either come to blows, or be undecided, for want of a right Reason constituted by Nature; so is it also in all debates of what kind soever.”
—Thomas Hobbes (1579–1688)