Abstract
In this paper, we introduce two interpretations of rough sets: rough sets as distinction among positive, negative and boundary regions and rough sets as approximations by means of elementary sets. It is shown that definitions, properties and definabilities are different by the interpretations of rough sets under a similarity relation. We apply those two kinds of rough sets to the extraction of if-then rules from an information table. We demonstrate the differences of the extracted if-then rules by the rough set interpretations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U. (1998) Extensions and intensions in the rough set theory, Information Sciences 107, 149–167.
Dubois, D., Prade, H. (1980) Fuzzy Sets and Systems: Theory and Applications, Academic Press, New York, 1980.
Dubois, D., Prade, H. (1992) Putting rough sets and fuzzy sets together. in: Slowinski, R. (Ed.) Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, Kluwer Academic Publishers, Dordrecht, 203–232.
Greco, S., Matarazzo, B., Slowinski, R. (1999) The use of rough sets and fuzzy sets in MCDM. in: Gal, T., Stewart, T. J., Hanne, T. (Eds.) Multicriteria Decision Making: Advances in MCDM Models, Algorithms, Theory, and Applications, Kluwer Academic Publishers, Boston, 14–1–14–59.
Inuiguchi, M., Tanino, T. (2000) Fuzzy rough sets based on certainty qualifications. Proceedings of the Forth Asian Fuzzy Systems Symposium 1, 433–438.
Inuiguchi, M., Tanino, T. (2001) On rough sets under generalized equivalence relations. Bulletin of International Rough Set Society 5(1/2), 167–171.
Pawlak, Z. (1991) Rough Sets: Theoretical Aspects of Reasoning About Data, Boston, MA, Kluwer Academic Publishers, 1991.
Shan, N., Ziarko, W. (1995) Data-based acquisition and incremental modification of classification rules. Computational Intelligence 11, 357–370.
Skowron, A., Rauser, C. M. (1992) The discernibility matrix and functions in information systems. in: Slowinski, R. (ed.) Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, Kluwer Academic Publishers, Dordrecht, 331–362.
Slowinski, R., Vanderpooten, D. (2000) A generalized definition of rough approximations based on similarity. IEEE Transactions on Data and Knowledge Engineering 12(2), 331–336.
Yao, Y. Y. (1996) Two views of the theory of rough sets in finite universes, Int. J. Approximate Reasoning 15, 291–317.
Yao, Y. Y., Lin T. Y. (1996) Generalization of rough sets using modal logics, Intelligent Automation and Soft Computing 2(2), 103–120.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Inuiguchi, M., Tanino, T. (2003). Two Directions toward Generalization of Rough Sets. In: Inuiguchi, M., Hirano, S., Tsumoto, S. (eds) Rough Set Theory and Granular Computing. Studies in Fuzziness and Soft Computing, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36473-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-36473-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05614-7
Online ISBN: 978-3-540-36473-3
eBook Packages: Springer Book Archive