Computer Science – Artificial Intelligence
Scientific paper
2009-11-28
International Journal of Approximate Reasoning, 52(3): 461-472, 2011
Computer Science
Artificial Intelligence
13 pages; to appear in International Journal of Approximate Reasoning
Scientific paper
Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have been applied to covering rough sets. In this paper, we further investigate the covering rough sets based on neighborhoods by approximation operations. We show that the upper approximation based on neighborhoods can be defined equivalently without using neighborhoods. To analyze the coverings themselves, we introduce unary and composition operations on coverings. A notion of homomorphismis provided to relate two covering approximation spaces. We also examine the properties of approximations preserved by the operations and homomorphisms, respectively.
No associations
LandOfFree
Covering rough sets based on neighborhoods: An approach without using neighborhoods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Covering rough sets based on neighborhoods: An approach without using neighborhoods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covering rough sets based on neighborhoods: An approach without using neighborhoods will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-18446