Abstract
The problem of approximating an arbitrary relation by a relation with desired properties is formally defined and analysed. Two special cases, approximation by partial orders and approximation by equivalence relations are discussed in detail.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley (1983)
Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer (1981)
Huth, M.R.A., Ryan, M.D.: Logic in Computer Science. Cambridge University Press (2000)
Janicki, R.: Pairwise comparisons based non-numerical ranking. Fundamenta Informaticae 94(2), 197–217 (2009)
Janicki, R.: On Rough Sets with Structures and Properties. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS(LNAI), vol. 5908, pp. 109–116. Springer, Heidelberg (2009)
Janicki, R.: Approximations of arbitrary binary relations by partial orders. Classical and rough set models. In: Peters et al. [11], pp. 17–38
Janicki, R., Zhai, Y.: On a pairwise comparison based consistent non-numerical ranking. Logic Journal of IGPL (2011), doi:10.1093/jigpal/jzr018
Kuratowski, K., Mostowski, A.: Set Theory, 2nd edn. North-Holland (1976)
Pawlak, Z.: Rought Sets. International Journal of Computer and Information Sciences 34, 557–590 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. System Theory, Knowledge Engineering and Problem Solving, vol. 9, Kluwer Academic Publishers, Dordrecht (1991)
Peters, J.F., Skowron, A., Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.): Transactions on Rough Sets XIII. LNCS, vol. 6499. Springer, Heidelberg (2011)
Rosen, K.H.: Discrete Mathematics and Its Applications. McGraw-Hill, New York (1999)
Skowron, A., Stepaniuk, J.: Approximation of relations. In: Ziarko, W. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, Workshops in Computing, pp. 161–166. Springer & British Computer Society, London, Berlin (1994)
Skowron, A., Stepaniuk, J.: Tolarence approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)
Stewart, J.: Calculus. Concepts and Contexts. Brooks/Cole (1997)
Yao, Y.Y.: Two views of the theory of rough sets in finite universes. International Journal of Approximate Reasoning 15, 291–317 (1996)
Yao, Y.Y., Wang, T.: On Rough Relations: An Alternative Formulation. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 82–91. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Janicki, R. (2013). Property-Driven Rough Sets Approximations of Relations. In: Skowron, A., Suraj, Z. (eds) Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam. Intelligent Systems Reference Library, vol 42. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30344-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-30344-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30343-2
Online ISBN: 978-3-642-30344-9
eBook Packages: EngineeringEngineering (R0)