Abstract
This paper gives the definition of discernibility matrix of granularity in decision table and the corresponding attribute reduction and the definition of discernibility matrix of granularity in the simplified decision table and the corresponding attribute reduction. Therefore, verifying the equivalence of the definition of attribute reduction in the simplified decision table and the definition of attribute reduction based on relative granularity of decision table. On the basis of the above theories, a new algorithm is designed based on knowledge granulation for attribute reduction in simplified decision table, and the corresponding complexity of time is reduced to O(|C|2|U′ pos ||U|). Finally, an example is given to illustrate the validity of the new 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.: Rough Sets. International Journal of Computer and Imforation Science 11, 341–356 (1982)
Zhangyan, X., Zuopeng, L., Pingru, Y.: A quick attribute reduction algorithm which complexity is max(O(|C||U|),O|C||U / C|). Int. Journal of Geographical Sciences 29, 391–399 (2006)
Duoqian, M., Guoyin, W., Qing, L.: Granular computing: past, present and future. In: Abadi, M. (ed.), Science Press, Beijing (2007)
Yao, Y.Y.: Granular computing: Basics and possible solutions. In: Proceedings of the 5th International Conference on Computing and Information, vol. 1, pp. 186–189 (2000)
Yao, Y.Y.: Granular computing: Past, present and future. In: 2008 IEEE International Conference on Granular Computing, pp. 80–85 (2008)
Yao, Y.Y.: The rise of granular computing. Int. Journal of Chongqing University of Posts and Telecommunications: Natural Science Edition 20, 299–308 (2008)
Xiuhong, L., Kaiquan, S.: A attribute reduction method of information system based on knowledge granularity. Int. J. Computer Application 26, 76–77 (2006)
Xiuhong, L.: Knowledge Granularity of Rough Set Concept and Operation. Int. J. Computer Engineering and Applications 47, 34–36 (2011)
Zhangyan, X., Pingru, Y., Wei, S.: A quick algorithm of computing core based on discernibility matrix. Int. Journal of Geographical Sciences 42, 4–5 (2006)
Zhangyan, X.: A quick algorithm of computing core based on positive region. Int. J. Systems Engineering and Electronics 28, 1902–1905 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, Z., Wang, X., Zhang, W. (2013). Attribute Reduction Algorithm Based on the Simplified Discernibility Matrix of Granularity. In: Yang, Y., Ma, M., Liu, B. (eds) Information Computing and Applications. ICICA 2013. Communications in Computer and Information Science, vol 391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53932-9_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-53932-9_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53931-2
Online ISBN: 978-3-642-53932-9
eBook Packages: Computer ScienceComputer Science (R0)