Abstract
Knowledge reduction is one of challenging problems in rough set theory, many static knowledge reduction algorithms have been proposed, however, since the objects in the actual information system are often changed, these static algorithms are computationally time-consuming. In order to overcome this shortcoming, the concept of simplified information system is introduced, and it is proved that knowledge reduction based on the simplified discernibility matrix is equivalent to that based on skowron’s discernibility matrix, On this condition, an efficient incremental updating algorithm for knowledge reduction is designed, which can be used to improve the efficiency of knowledge reduction, when a new object is added to information system. Finally, Theoretical analysis and example results show that illustrate the efficiency and feasibility of the algorithm.
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
Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Science 117(1), 3–37 (2007)
Skowron, A., Rauszer, C.: The discernibility matrix and function in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kluwer Press, Dordrecht (1992)
Wang, G.Y., Yu, H., Yang, D.C.: Decision table reduction based on information entropy. Chinese Journal of Computers 25(7), 759–766 (2002)
Xu, Z.Y., Yang, B.R.: A quick attribution reduction algorithm with complexity of max {O(|U||C|), O(|C|2|U/C|}. Chinese Journal of Computer 29(3), 391–399 (2006)
Wang, J., Wang, J.: Reduction algorithms based on discernibility matrix: the ordered attributes method. Journal of Computer Science and Technology 16(6), 489–504 (2001)
Li, F., Liu, Q., Ye, M., Yang, G.W.: Approaches to Knowledge Reduction s in Decision Tables. Control and Decision 21(8), 857–862 (2006)
Miao, D.Q., Cheng, Y.M.: Knowledge Reduction Algorithm under Graph View. Acta Electronic Sinca 38(8), 1952–1957 (2010)
Yang, M.: An incremental updating algorithm for attribute reduction based on improved discernibility matrix. Chinese Journal of Computers 30(5), 815–822 (2007)
Hu, F., Dai, J., Wang, G.Y.: Incremental algorithms for attribute reduction in decision table. Control and Decision 22(3), 268–272 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, C., Ruan, J. (2011). An Efficient Incremental Updating Algorithm for Knowledge Reduction in Information System. In: Hu, W. (eds) Electronics and Signal Processing. Lecture Notes in Electrical Engineering, vol 97. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21697-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-21697-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21696-1
Online ISBN: 978-3-642-21697-8
eBook Packages: EngineeringEngineering (R0)