Abstract
Rough set theory is a useful and effective tool to cope with granularity and vagueness in information system and has been used in many fields. However, it is hard to get the reduct of a covering in rough sets. This paper attempts to get the reduct of a covering at a high speed in theory. It defines upset and downset based on a poset in a covering, studies the relationship between reducible element and downset, and obtains some good results such as sufficient and necessary condition about the reducible element in a covering.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Zhu, W.: Generalized rough sets based on relations. Information Sciences 177, 4997–5011 (2007)
Zhu, W.: Relationship between generalized rough sets based on binary relation and covering. Information Sciences 179, 210–225 (2009)
Zhu, W.: Relationship among basic concepts in covering-based rough sets. Information Sciences 17, 2478–2486 (2009)
Zhu, W.: Topological approaches to covering rough sets. Information Sciences 177, 1499–1508 (2007)
Pawlak, Z., Skowron, A.: Rough sets and boolean reasoning. Information Sciences 177, 41–73 (2007)
Yao, Y.Y.: Constructive and algebraic methods of theory of rough sets. Information Sciences 109, 21–47 (1998)
Zhu, W., Wang, F.Y.: On three types of covering rough sets. IEEE Transactions on Knowledge and Data Engineering 19, 1131–1144 (2007)
Zhu, W., Wang, F.Y.: Reduction and axiomization of covering generalized rough sets. Information Sciences 152, 217–230 (2003)
Lu, S.: The measure on the continuous poset. Journal of Sichuan University 41, 1137–1142 (2004)
Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U.: Extensions and intentions in the rough set theory. Information Sciences 107, 149–167 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, S., Zhu, W., Zhu, P. (2010). Poset Approaches to Covering-Based Rough Sets. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds) Rough Set and Knowledge Technology. RSKT 2010. Lecture Notes in Computer Science(), vol 6401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16248-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-16248-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16247-3
Online ISBN: 978-3-642-16248-0
eBook Packages: Computer ScienceComputer Science (R0)