Rough Set Theory
Jump to navigation
Jump to search
See: Rough Set, Set Theory, Theory, Granular Computing Theory.
References
2009
- (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Rough_set
- A rough set, first described by 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.
2007
- (Pawlak & Skowron, 2007) ⇒ Zdzislaw Pawlak, and Andrzej Skowron. (2007). “Rudiments of Rough Sets.” In: Information Sciences, 177(1). doi:10.1016/j.ins.2006.06.003
1982
- (Pawlak, 1982) ⇒ Zdzislaw Pawlak. (1982). “Rough Sets.” In: International Journal of Parallel Programming, 11(5). doi:10.1007/BF01001956.