Title :
Rough Sets in Partially Ordered Sets
Author :
Li, Kai ; Zhu, William ; Tang, Jianguo
Author_Institution :
Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
Abstract :
It is well-known to us that the Pawlak´s rough set theory, an effective tool to deal with uncertainty and granularity in information systems, is based on equivalence relation. However, in some situations, those conditions of equivalence relation are hardly met. In this paper, we define a new type of upper and lower approximations of rough set in partially ordered sets and propose the reducible element in this situation. In the end, we prove some properties of rough set in the partially ordered sets which can form a covering.
Keywords :
rough set theory; Pawlak rough set theory; equivalence relation; granularity; information systems; partially ordered sets; reducible element; uncertainty; Approximation methods; Data engineering; Knowledge engineering; Lattices; Rough sets;
Conference_Titel :
Granular Computing (GrC), 2010 IEEE International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
978-1-4244-7964-1
DOI :
10.1109/GrC.2010.154
