Abstract
In view of granular computing, the classical optimistic and pessimistic multigranulation rough set models are both primarily based on simple granules among multiple granular structures, namely multiple partitions of the universe in MGRS. This correspondence paper presents a new rough set model where set approximations are defined by using multiple coverings on the universe. In order to distinguish Qian’s covering-based optimistic multigranulation rough set model, we call the new rough set model as covering-based pessimistic multigranulation rough set model. The key distinction between covering-based pessimistic multigranulation rough set model and Qian’s covering-based optimistic multigranulation rough set model is set approximation descriptions. Then some properties are proposed for covering-based pessimistic multigranulation rough set model.
Keywords
- Covering
- Multigranulation
- Pessimistic
- Rough sets
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pawlak, Z.: Rough sets. International Journal of computer and Information Sciences 11, 341–365 (1982)
Pawlak, Z.: Rough sets, Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Dordrecht (1991)
Liang, J.Y., Li, D.Y.: Uncertainty and knowledge acquisition in information systems. Science Press, Beijing (2005)
Swiniarski, W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recognition Letters 24(6), 849–883 (2003)
Li, D., Zhang, B., Leung, Y.: On knowledge reduction in inconsistent decision information systems. International Journal of Uncertainty, Fuzziness Knowledge-Based Systems 12(5), 651–672 (2004)
Wang, G., Yu, H., Yang, D.: Decision table reduction based on conditional information entropy. Chinese Journal of Computers 25(7), 1–9 (2002)
Qian, Y.H., Liang, J.Y., Witold, P.: Positive approximation: an accelerator for attribute reduction in rough set theory. Artificial Intelligence 174, 597–618 (2010)
Apolloni, B., Brega, A., Malchiodi, D., Palmas, G., Zanaboni, A.M.: Learning rule representations from data. IEEE Transations Systems Man and CYbernetics Part B 36(5), 1010–1028 (2006)
Tsumoto, S.: Automated extraction of hierarchical decision rules from clinical databases using rough set model. Expert Systems and Application 24(2), 189–197 (2003)
Liang, J.Y., Qian, Y.H.: Information granules and entropy theory in information systems. Science in China-Series F: Information Sciences 51(9), 1–18 (2008)
Qian, Y.H., Liang, J.Y., Li, D.Y.: Measures for evaluating the decision performance of a decision table in rough set theory. Informations Science (178), 181–202 (2008)
Qian, Y.H., Liang, J.Y., Dang, C.Y.: Consistency measure, inclusion degree and fuzzy measure in decision tables. Fuzzy Sets and Systems (159), 2353–2377 (2008)
Liang, J., Qian, Y.: Axiomatic approach of knowledge granulation in information system. In: Sattar, A., Kang, B.-h. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 1074–1078. Springer, Heidelberg (2006)
Lin, T.Y.: Granular Computing on binary relations I: data mining and neighourhood systems. Rough sets and Knowledge Discovery, 107–121 (1998)
Yao, Y.Y.: Information granulation and rough set approximation. International Journal of Intelligence Systems 16(1), 87–104 (2001)
Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Transactions on Knowledge and Data Engineering 12, 331–336 (2000)
Kryszkiewicz, M.: Rough set approach to incomplete information systems. Information Sciences 112, 39–49 (1998)
Bonikowski, Z., Brynirski, E., Wybraniec, U.: Extensions and intentions in the rough set theory. Information Sciences 107, 149–167 (1998)
ZaKowski, W.: Approximations in the space (U, Π). Demonstration Mathematica 16, 761–769 (1983)
Zhu, W., Wang, F.Y.: On three types of covering rough sets. IEEE Transactions on Knowledge Data Engineering 19(8), 1131–1144 (2007)
Chen, D.G., Wang, C.Z., Hu, Q.H.: A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. Information Sciences 177, 3500–3518 (2007)
Qian, Y.H., Liang, J.Y., Yao, Y.Y., Dang, C.Y.: MGRS: A multigranulation rough set. Information Sciences 180, 949–970 (2010)
Qian, Y.H., Liang, J.Y., Wei, W.: Pessimistic rough decision. In: 2nd International Workshop on Rough Sets Theory, pp. 19–21. Zhoushan (2010)
Qian, Y. H., Liang, J. Y.: Granulation mechanism and Data Modeling for Complex Data. Phd thesis, Shanxi University (2011)
Pomykala, J.A.: Approximation operations in approximation space. Bulletin of the Polish Academy of Sciences 9-10, 653–662 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, G., Li, J. (2012). A Covering-Based Pessimistic Multigranulation Rough Set. In: Huang, DS., Gan, Y., Premaratne, P., Han, K. (eds) Bio-Inspired Computing and Applications. ICIC 2011. Lecture Notes in Computer Science(), vol 6840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24553-4_89
Download citation
DOI: https://doi.org/10.1007/978-3-642-24553-4_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24552-7
Online ISBN: 978-3-642-24553-4
eBook Packages: Computer ScienceComputer Science (R0)
