Roughness bounds in rough set operations

Simple item page
dc.contributor.authorYang, Yingjieen
dc.contributor.authorJohn, Robert, 1955-en
dc.date.accessioned2008-11-24T13:24:14Z
dc.date.available2008-11-24T13:24:14Z
dc.date.issued2006-11-01en
dc.descriptionThe propagation and combination of uncertainties can significantly influence the performance of an information system. Although there have been great efforts in the propagation of randomness, fuzziness and other uncertainties, there is not yet a thorough study for the propagation of roughness in rough set operations. The derivation of a roughness bound for various rough set operations is given. We proved that there is no defined bound for the intersection operation of any two rough sets but there are bounds for union, complement and most difference operations. This is beneficial for decision making involving large volumes of rough set operations.en
dc.identifier.citationYang, Y. and John, R.I. (2006) Roughness bounds in rough set operations. Information Sciences, 176(21), pp. 3256-3267.
dc.identifier.doihttps://doi.org/10.1016/j.ins.2006.02.009
dc.identifier.issn0020-0255en
dc.identifier.urihttp://hdl.handle.net/2086/183
dc.language.isoenen
dc.publisherElsevieren
dc.researchgroupCentre for Computational Intelligence
dc.researchgroupDIGITSen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en
dc.subjectRAE 2008
dc.subjectUoA 23 Computer Science and Informatics
dc.subjectrough sets
dc.subjectroughness
dc.titleRoughness bounds in rough set operationsen
dc.typeArticleen

Files

Collections

School of Computer Science and Informatics