Rough Sets and Textural Neighbourhoods
In this work, we discuss the neighbourhoods and approximation operators using p-sets and q-sets of a texture. Here, we show that the presections of a direlation correspond to lower and upper approximations in terms of successor neighbourhood operators while the sections of a direlation correspond to lower and upper approximations in terms of predecessor neighbourhood operators. For discrete textures, we observe that the weak forms of definabilities are preserved under the relation preserving bijective functions where the inverses are also relation preserving.
KeywordsApproximation operator Definability Direlation Neighbourhood operators Rough set Texture space
- 10.Grzymala-Busse, J.W., Rzasa W.: Definability of approximations for a generalization of the indiscernibility relation, In: Proceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence pp. 65–72 (2007)Google Scholar
- 11.Kryszkiewicz, M.: Rough set approach to incomplete information systems. In: Proceedings of the Second Annual Joint Conference on Information Sciences, pp. 194–197 (1995)Google Scholar
- 15.Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)Google Scholar