Abstract
The effective reduct algorithm is the foundation to use the rough set theory in data mining and knowledge discovery in database. In this paper, we discuss the well-known reduct algorithms, and propose the conception of discernibility index of attribute. We also propose the algorithm about division and reducts of information system based on discernibility index of attribute. We analyze the completeness and validity of the algorithm. The experiments indicate that our algorithm is efficient and practical.
This work was supported by the Natural Foundation of Jilin province under Grant No. 19990528.
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
Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Pawlak, Z., et al.: Rough Sets. Communication of the ACM 38, 189–195 (1995)
Wong, S.K.M., Ziarko, W.: Optimal Decision Rules in Decision Table. Bulletin of Polish Academy of Sciences 33(11-12), 693–696 (1985)
Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362 (1992)
Hu, X., Cercone, N.: Learning in Relational Database: A Rough Sets Approach. Computational Intelligence 11, 323–355 (1995)
Miao, D.Q., Wang, J.: An Information Based Algorithm for Reduction of Knowledge. Technical Report, Institute of Automation, Chinese Academy of Sciences (March 1996)
Keyun, H.: Research on Concept Lattice and Rough Set Based Data Mining Methods, Ph.D thesis, Tsinghua University (2001)
Bjorvand, A.T.: ‘Rough Enough’ – A System Supporting the Rough Sets Approach (1998), http://home.sn.no/~torvill
Kryszkiewicz, M., Rybinski, H.: Finding Reducts in Composed Information Systems. In: Ziarko, W.P. (ed.) Proceedings of RSKD 1993, pp. 261–273. Springer, London (1993)
Starzyk, J., Nelson, D.E., Sturtz, K.: A Mathematical Foundation for Improved Reduct Generation in Information Systems. Knowledge and Information Systems 2, 131–146 (2000)
Starzyk, J., Nelson, D.E., Sturtz, K.: Reduct Generation in Information System. Bulletin of international rough set society 3(1/2), 19–22 (1999)
Bazan, J., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables. In: Ras, Z.W., Zemankiva, M. (eds.) Methodologies for Intelligent Systems, pp. 346–355. Springer, Berlin (1994)
Hu, X.T., Lin, T.Y., Han, J.: A New Rough Sets Model Based on Database Systems. In: Wang, G., et al. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 114–121. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Li, X., Liu, H., Chen, X. (2004). The Algorithm About Division and Reducts of Information System Based on Discernibility Index of Attribute. In: Chi, CH., Lam, KY. (eds) Content Computing. AWCC 2004. Lecture Notes in Computer Science, vol 3309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30483-8_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-30483-8_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23898-0
Online ISBN: 978-3-540-30483-8
eBook Packages: Springer Book Archive