Abstract
The problem of approximating an arbitrary binary relation by a partial order is formally defined and analysed. Five different partial order approximations of an arbitrary binary relation are provided and their relationships analysed. Both the classical relational algebra model and a model based on the Rough Set paradigm are discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arrow, K.J.: Social Choice and Individual Values. J. Wiley, New York (1951)
Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, New York (1981)
Cowan, N.: The magical number 4 in short-term memory. A reconsideration of mental storage capacity. Behavioural and Brain Sciences 24, 87–185 (2001)
Dyer, J.S.: Remarks on the Analytic Hierarchy Process. Management Sci. 36, 244–258 (1990)
Fishburn, P.C.: Interval Orders and Interval Graphs. J. Wiley, New York (1985)
French, S.: Decision Theory. Ellis Horwood, New York (1986)
Huth, M.R.A., Ryan, M.D.: Logic in Computer Science. Cambridge University Press, Cambridge (2000)
Janicki, R.: Pairwise Comparisons, Incomparability and Partial Orders. In: Proc. of Int. Conf. on Enterprise Information Systems, ICEIS 2007, Funchal, Portugal, vol. 2, pp. 297–302 (2007)
Janicki, R.: Ranking with Partial Orders and Pairwise Comparisons. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 442–451. Springer, Heidelberg (2008)
Janicki, R.: Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol. 5306, pp. 81–91. Springer, Heidelberg (2008)
Janicki, R., Koczkodaj, W.W.: Weak Order Approach to Group Ranking. Computers Math. Applic. 32(2), 51–59 (1996)
Janicki, R., Koutny, M.: Structure of Concurrency. Theoretical Computer Science 112, 5–52 (1993)
de Condorcet, M.: Essai sur l’application de l’analyse a la probabilite des decisions rendue a la pluralite des voix, Paris (1785) (see [1])
Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley, Reading (2006)
Kuratowski, K., Mostowski, A.: Set Theory, 2nd edn. North-Holland, Amsterdam (1976)
Pawlak, Z.: Rought Sets. International Journal of Computer and Information Sciences 34, 557–590 (1982)
Pawlak, Z.: Rough Sets. Kluwer, Dordrecht (1991)
Rosen, K.H.: Discrete Mathematics and Its Applications. McGraw-Hill, New York (1999)
Saaty, T.L.: A Scaling Methods for Priorities in Hierarchical Structure. Journal of Mathematical Psychology 15, 234–281 (1977)
Schröder, E.: Algebra der Logik. Teuber, Leipzig (1895); 2nd edition published by Chelsea (1966)
Skowron, A., Stepaniuk, J.: Approximation of relations. In: Ziarko, W. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, pp. 161–166. Springer, London (1994)
Skowron, A., Stepaniuk, J.: Tolarence approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)
Stewart, J.: Calculus. Concepts and Contexts. Brooks/Cole, Pacific Grove (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 Formulations. 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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janicki, R. (2011). Approximations of Arbitrary Binary Relations by Partial Orders: Classical and Rough Set Models. In: Peters, J.F., Skowron, A., Chan, CC., Grzymala-Busse, J.W., Ziarko, W.P. (eds) Transactions on Rough Sets XIII. Lecture Notes in Computer Science, vol 6499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18302-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-18302-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18301-0
Online ISBN: 978-3-642-18302-7
eBook Packages: Computer ScienceComputer Science (R0)