Abstract
Reducts are applied to represent the knowledge without superfluous attributes in rough set. In this paper, a two-phase β-certain reducts generation is developed to preserve the original classification of each decision class in the table under the majority inclusion relation with a user defined admissible error β. The first phase finds the initial solutions of β-certain reducts. Initial solutions are passed to the second phase and β-certain reducts are found by generating certain reducts of the second pseudo decision when all sub categories based on these certain reducts in the non-β-positive region are totally rejected under the β criterion. No verification is needed when β-certain reducts are found.
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.
References
Bazan, J.G., et al.: Rough set algorithms in classification problems. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems, pp. 49–88. Physical-Verlag, Heidelberg (2000)
Beynon, M.: Reducts with the variable precision rough set model: A further investigation. European Journal of Operating Research 134, 592–605 (2001)
Beynon, M.: The introduction and utilization of (l, u)-graphs in the extended variable precision rough set model. International Journal of Intelligent System 18, 1035–1055 (2003)
Inuiguchi, M.: Attribute Reduction in Variable Precision Rough Set Model. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 14(4), 461–479 (2006)
Komorowski, J., et al.: Rough sets: a tutorial. In: Pal, S.K., Skowron, A. (eds.) Rough Fuzzy Hybridization: A New Trend in Decision-Making, pp. 3–98. Springer, Heidelberg (1999)
Kryszkiewicz, M.: Maintenance of reducts in the variable precision rough set model. ICS Research Report, 31/94. Warsaw University of Technology (June1994)
Nguyen, S.H., Nguyen, H.S.: Some efficient algorithms for rough set methods. In: Proc. of Information Processing and Management of Uncertainty in Knowledge-Based Systems, pp. 1451–1456 (1996)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht (1991)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information Systems. Fundamenta Informaticae 15(2), 331–362 (1991)
Wang, P.C.: Highly scalable rough set reducts generation. Journal of Information Science and Engineering 23(4) (2007)
Wang, P.C.: Monotonic reducts generation using fbHash in Rough Set. Submitted to Data and Knowledge Engineering.
Ziarko, W.: Variable precision rough set model. Journal of Computer and System Sciences 46(1), 39–59 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Wang, PC., Chiou, HK. (2007). Two-Phase β-Certain Reducts Generation. In: Yao, J., Lingras, P., Wu, WZ., Szczuka, M., Cercone, N.J., Ślȩzak, D. (eds) Rough Sets and Knowledge Technology. RSKT 2007. Lecture Notes in Computer Science(), vol 4481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72458-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-72458-2_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72457-5
Online ISBN: 978-3-540-72458-2
eBook Packages: Computer ScienceComputer Science (R0)