Topological structure on generalized approximation space related to n-arry relation
Subject Areas : Statistics
Syyed Ba Ba
Hosseini
1
(Department of mathematics, Sari branch, Sari, Iran.)
Keywords: مجموعه نادقیق تعمیم یافته, فضای تقریب, رابطه قویاتحمل پذیر, توپولوژی نادقیق,
Abstract :
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a universe. There are many studies on the relations between generalized rough set approximation and rough topological space. In this paper, We are defined some properties of an n-ary relation such as reflexive, symmetry, strongly symmetry, quasi-transitive, n- transitive and n-equivalence on a set . We introduce topological method to generalized rough set and study the relationship between topological theory and rough set theory. By using an n-ary tolerance relation and quasi-transitive relation, we define a topology on nonempty set . In the end, we prove some topological properties such as quasi-discreteness, connectivity, compactness, quasi-metric able, separateness.
[1] Cristea and M. Stefanescu,
Hypergroup and n- ary relations,
European J. Combin. 31 (2010),
no. 3, 780-789
[2] R. Engelking, General Topology, Polish Scientific Publishers, Warszawa, 1977.
[3] Z. Li, Topological properties of generalized rough sets, in: 2010 Seventh International Conference on Fuzzy
Systems and Knowledge Discovery, vol. 5, 2010, pp.
2067–2070.
[4] M. Kondo, On the structure of generalized rough sets, Information Science 176 (2006) 589–600.
[5] M. Novotny, Ternary structures and groupoids, Czech. Math. J. 41 (116) (1991) 90-98.
[6] Z. Pawlak, Rough sets, International Journal of Computing and Information Sciences 11 (1982) 341–356.
[7] Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning About Data, Kluwer Academic Publishers, Boston, 1991.
[8] Z. Pawlak, A. Skowron, Rough sets: some extensions, Information Sciences 177 (2007) 28–40.
[9] Z. Pawlak, A. Skowron, Rudiments of rough sets, Information Sciences 177 (2007) 3–27.
[10] K. Qin, J. Yang, Z. Pei, Generalized rough sets based on reflexive and transitive relations, Information Sciences 178 (2008) 4138–4141.
[11] T. K. Sheeja, T. M. Jacob , A. Sunny Kuriakose. ,Rough topology on approximation spaces, International Journal of advanced research in computer science, Vo. 8, No. 9
, 2017, 379-384.
[12] . Slowinski, D. Vanderpooten, Similarity relation as a basis for rough
approximations, ICS Research Report 53 (1995) 249–250.
[13] R. Slowinski, D. Vanderpooten, A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering 12 (2000) 331–336.
[14] . Skowron, J. Stepaniuk, Tolerance approximation spaces, Fundamenta
Informaticae 27 (1996) 245–253.
[15] . Zhang, Y. Ouyang, Z. Wang, Note on ‘‘Generalized rough sets based on reflexive and transitive relations’’, Information Sciences 179 (2009) 471–473.
[16] W. Zhu, Generalized rough sets based on relations, Information Sciences 177 (2007) 4997–5011.
[17] W. Zhu, Relationship between generalized rough sets based on binary relation and covering, Information Sciences 179 (2009) 210–225.
[18] W. Zhu, Topological approaches to covering generalized rough sets, Information Sciences 177 (2007) 1499–1508.
