Distance Measures Induced by Finite Approximation Spaces and Approximation Operators

• Autorzy: Wolski M.
• Języki publikacji: EN

Abstrakty

EN

In this paper we study metric properties of finite approximation spaces and approximation operators from Rough Set Theory. In the first part of the article we examine finite approximation spaces and finite approximation topological spaces regarded as particular instances of two basic types of information structures from the framework of Information Quanta: information quantum relational systems and property systems, respectively. In the second part of the paper is the Marczewski-Steinhaus metric discussed as a certain distance of sets defined with respect to the approximation operators. We propose two types of á la Marczewski-Steinhaus distance functions: the first type is based on the lower approximation operator; the second one is based on the upper approximation operator. These types can be defined with respect to both finite approximation spaces (information quantum relational systems) and finite approximation topological spaces (property systems), giving us four distance measure functions. In order to define a distance of sets which preserves their lower and upper approximations, one can take the sum of two respective functions.

Słowa kluczowe

EN

rough set theory; approximation space; approximation operators

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2008
• Tom: Vol. 85, nr 1-4
• Strony: 497--512
• Opis fizyczny: bibliogr. 18 poz.

Twórcy

autor

Wolski M.

• Department of Logic and Methodology of Science, Maria Curie-Skłodowska University, Lublin, Poland,

Bibliografia

• [1] De Groot, J. (1956), Non-archimedean metrics in topology, Proc. Amer. Math. Soc., 9, 948-953.
• [2] Erne, M., Stege, K. (1991), Counting finite posets and topologies, Order, 8, 247-265.
• [3] Erné, M., Klossowski, E.,Melton, A., Strecker, G. E. (1993),A primer on Galois connections, in Proceedings of the 1991 Summer Conference on General Topology and Applications in Honour of Mary Elen Rudin and Her Work, Vol. 704 of Annals of the New York Academy of Sciences, 103-125.
• [4] Güldürdek, A., Richmond, T. (2005), Every Finite Topology is Generated by a Partial Pseudometric, Order, 4, Vol. 22, 415-421.
• [5] Marczewski, E., Steinhaus, H. (1958), On a certain distance of sets and the corresponding distance of functions, Colloquium Mathematicum, Vol. VI, 319-327.
• [6] Polkowski, L. (2002), Rough Sets: Mathematical Foundations, Advances in Soft Computing, Physica-Verlag, Heidelberg.
• [7] Pagliani, P., Chakraborty,M. (2005), Information quanta and approximation spaces. I: Non-classical approximation operators, in Hu, X., Liu, Q., Skowron, A., Lin, T. S., Yager, R. R., Zhang, E. B. (Eds), Proceedings of the IEEE International Conference on Granular Computing, Vol. 2, IEEE, 605-610.
• [8] Pagliani, P., Chakraborty,M. (2005), Information quanta and approximation spaces. II: Generalised approximation space, in Hu, X., Liu, Q., Skowron, A., Lin, T. S., Yager, R. R., Zhang, E. B. (Eds), Proceedings of the IEEE International Conference on Granular Computing, Vol. 2, IEEE, 611-616.
• [9] Pawlak, Z. (1982), Rough sets, Int. J. Computer and Information Sci., 11, 341-356.
• [10] Pawlak, Z. (1991), Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publisher.
• [11] Rasiowa, H. (2001), Algebraic Models of Logics, University of Warsaw.
• [12] Vakarelov, D. (1998), Information systems, similarity and modal logics, in E. Orlowska (Ed.), Incomplete Information: Rough Set Analysis, Physica-Verlag, 492-550.
• [13] Wasilewski, P. (2004), On Selected Similarity Relations and their Applications into Cognitive Science (in Polish), PhD Thesis, Jagiellonian University, Cracow.
• [14] Wolski, M. (2004), Galois Connections and Data Analysis, Fundamenta Informaticae, 60, 401-415.
• [15] Wolski, M. (2005), Formal Concept Analysis and Rough Set Theory from the Perspective of Finite Topological Approximations, Transactions on Rough Sets, III, LNCS, Springer, 230-243.
• [16] Wolski, M. (2007), Approximation Spaces and Nearness Type Structures, Fundamenta Informaticae, 79, IOS Press, 567-577.
• [17] Wolski, M. (2008), Information Quanta and Approximation Operators: Once More around the Track, Transactions on Rough Sets, VIII, LNCS, Springer, 244-257.
• [18] Yao, Y. (2001), Information granulation and rough set approximation, International Journal of Intelligent Systems, 16, 87-104.