Abstract
Computing core attributes is one of key problems of rough set theory. Many researchers proposed lots of algorithms for computing core. Unfortunately, most of them are designed for static databases. However, many real datasets are dynamic. In this paper, a quick incremental updating core algorithm is proposed, which only allies on the updating parts of discernibility matrix and does not need to store, re-compute and re-analyze discernibility matrix, when new objects are added to decision table. Both of theoretical analysis and experimental results show that the algorithm is effective and efficient.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pawlak, Z.: Rough set. International Journal of Information and Computer Science 11(5), 341–356 (1982)
Hu, X.H., Cercone, N.: Learning in Relational Databases: A Rough Set Approach. International Journal of Computational Intelligence 11(2), 323–338 (1995)
Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Slowinski (ed.) Intelligent Decision Support-Handbook of Applications and Sdvances of the Rough Sets Theory, pp. 331–362. Kluwer Academic Publisher, Dordrecht (1991)
Ye, D.Y., Chen, Z.J.: A New Discernibility Matrix and the Computation of a Core. Acta Electronica Sinica 30(7), 1086–1088 (2002)
Wang, G.Y.: Rough Reduction in Algebra View and Information View. International Journal of Intelligent System 18(6), 679–688 (2003)
Wang, G.Y., Zhao, J., An, J.J., Wu, Y.: A comparative study of algebra viewpoint and information viewpoint in attribute reduction. Fundamenta Informaticae 68(6), 289–301 (2005)
Zhang, W.X., Wu, W.Z., Liang, J.Y.: Theory and Method of Rough Set, p. 7. Science Press, Beijing (2001)
Liu, W.J., Gu, Y.D., Feng, Y.B.: An Improved Attribute Reduction Algorithm of Decision Table. PR&AI 17(1), 119–123 (2004)
Yang, M., Sun, Z.H.: Improvement of Discernibility Matrix and the Computation of a Core. Journal of Fudan University(Natural Science) 43(5), 865–868 (2004)
Yang, M.: An incremental updating Algorithm of the computation of a core based on the improved discernibility matrix. Chinese Journal of Computers 29(3), 407–413 (2006)
Yang, C.J., Ge, H., Yao, G.S., Ma, L.S.: Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix. In: The International Conference on Computational Intelligence and Natural Computing, CINC 2009, Wuhan, China, vol. 2, pp. 103–106 (June 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ge, H., Yang, C., Yuan, W. (2010). A Quick Incremental Updating Algorithm for Computing Core Attributes. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds) Rough Set and Knowledge Technology. RSKT 2010. Lecture Notes in Computer Science(), vol 6401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16248-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-16248-0_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16247-3
Online ISBN: 978-3-642-16248-0
eBook Packages: Computer ScienceComputer Science (R0)