Roughness bounds in rough set operations
Copyright policy )Roughness bounds in rough set operations
Roughness indicates the significance of the uncertain elements of a rough set. This paper presents some bounds for rough set operations. The bounds obtained for the union as well as for the difference of rough sets depend on their operand's roughnesses. The roughness of the complement of a set is bounded with the ratio between the cardinalities of the upper approximations of the set and the universe, and it does not depend on the roughness of the set. The roughness of the intersection of two sets is always between \(0\) and \(1\).
- De Montfort University United Kingdom
roughness, information systems, UoA 23 Computer Science and Informatics, RAE 2008, Nonclassical and second-order set theories, rough sets, Theory of fuzzy sets, etc., Reasoning under uncertainty in the context of artificial intelligence, roughness
roughness, information systems, UoA 23 Computer Science and Informatics, RAE 2008, Nonclassical and second-order set theories, rough sets, Theory of fuzzy sets, etc., Reasoning under uncertainty in the context of artificial intelligence, roughness
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).15 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!