Rough Set

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:

    Under the greenwood tree
    Who loves to lie with me,
    And turn his merry note
    Unto the sweet bird’s throat,
    Come hither, come hither, come hither!
    Here shall he see
    No enemy
    But winter and rough weather.
    William Shakespeare (1564–1616)

    I set it down as a fact that if all men knew what each said of the other, there would not be four friends in the world.
    Blaise Pascal (1623–1662)