Authors: B.K. Tripathy, Anirban Mitra
Addresses: School of Computing Sciences, VIT University, Vellore – 632014, Tamil Nadu, India. ' Department of Computer Science, Berhampur University, Berhampur – 760 007, Orissa, India
Abstract: Properties of approximations of sets establish that lower approximation of union of sets is not equal to the union of their lower approximations in general and a similar result holds for upper approximation of intersection of sets. This confirms to the observation that there is a loss of information in a distributed knowledge base than in an integrated one. We obtain necessary and sufficient conditions for equalities to hold in the above two properties. We find that there are ambiguities in types of union and intersection of rough sets and establish theorems to reduce these ambiguities. Novotny and Pawlak introduced three (bottom, top and total) types of rough equalities, which show that comparison of domains depends upon our knowledge about the universe. We obtain suitable conditions under which the top and bottom rough equalities can be interchanged in these properties. Example of a distributed database of employees is used throughout.
Keywords: rough sets; lower approximation; upper approximation; knowledge base; equivalence relation; bottom R-equal; top R-equal.
International Journal of Granular Computing, Rough Sets and Intelligent Systems, 2010 Vol.1 No.4, pp.355 - 369
Available online: 20 Nov 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article