Abstract
This chapter, from the viewpoint of approximation, introduces an evaluation criterion for relative reducts using roughness of partitions constructed from them. The outline of relative reduct evaluation we propose is: “Good” relative reducts \(=\) relative reducts that provide partitions with approximations as rough and correct as possible. In this sense, we think that evaluation of relative reducts is strictly concerned with evaluation of roughness of approximation.
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
References
Bao, Y., Du, X., Deng, M., Ishii, N.: An efficient method for computing all reducts, transactions of the Japanese Society for. Artif. Intell. 19, 166–173 (2004)
Forsyth, R.: Zoo data set. http://archive.ics.uci.edu/ml/datasets/Zoo (1990). Accessed 15 May 1990
Greco, S., Matarazzo, B., Slowinski, R.: Rough set theory for multicriteria decision analysis. Eur. J. Oper. Res. 129, 1–47 (2001)
Guan, J.W., Bell, D.A.: Rough Computational Methods for Information Systems. Artif. Intell. 105, 77–103 (1998)
Hedar, A.H., Wang, J., Fukushima, M.: Tabu search for attribute reduction in rough set theory. Soft Comput. 12, 909–918 (2008)
Hu, F., Wang, G., Feng, L.: Fast knowledge reduction algorithms based on quick sort. In: Wang, G. et al. (eds.), Rough Sets and Knowledge Technology, LNAI 5009, pp. 72–79, Springer, New York (2008)
Hu, K., Diao, L. Lu, Y., Shi, C.: A Heuristic optimal reduct Algorithm. In: Leung, K.S. et al. (eds.) Intelligent Data Engineering and Automated Learning, LNCS 1983, pp. 89–99, Springer, New York (2003)
Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Theory and Decision, Kluwer, Dordrecht (1992)
Polkowski, L.: Rough sets: Mathematical Foundations, Advances in Soft Computing, Physica-Verlag, Heidelberg (2002)
Ślȩzak, D.: Normalized decision functions and measures for inconsistent decision table analysis. Fundamenta Informaticae 44(3), 291–319 (2000)
Ślȩzak, D.: Approximate entropy reducts. Fundamenta Informaticae 53(3–4), 365–390 (2002)
Skowron, A., Rauszer, C.M.: The discernibility matrix and functions in information systems. In: Słowiński, R. (ed.) Intelligent Decision Support: Handbook of Application and Advances of the Rough Set Theory, pp. 331–362, Kluwer, Dordrecht (1992)
Wróblewski, J.: Adaptive Methods of Object Classification (in Polish), Ph.D. thesis, Institute of Mathematics, Warsaw University, Poland (2001)
Xu, J., Sun, L.: New Reduction algorithm based on decision power of decision table. In: Wang, G. et al. (eds.)Rough Sets and Knowledge Technology, LNAI 5009, pp. 180–188, Springer, New York (2008)
Xu, Z., Zhang, C., Zhang, S., Song, W., and Yang, B.: Efficient attribute reduction based on discernibility matrix. In: Yao, J.T. et al. (eds.) Rough Sets and Knowledge Technology, LNAI 4481, pp. 13–21, Springer, New York (2007)
Zhang, J., Wang, J., Li, D., He, H., Sun, J.: A new heuristic reduct algorithm based on rough sets theory. In: Dong, G. et al. (eds.) Advances in Web-Age Information Management, LNSC 2762, pp. 247–253. Springer, New York (2003)
Ziarko, W.: Variable precision rough set model, Journal of Computer and System. Science 46, 39–59 (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Akama, S., Kudo, Y., Murai, T. (2020). An Evaluation Method of Relative Reducts Based on Roughness of Partitions. In: Topics in Rough Set Theory. Intelligent Systems Reference Library, vol 168. Springer, Cham. https://doi.org/10.1007/978-3-030-29566-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-29566-0_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29565-3
Online ISBN: 978-3-030-29566-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)