Abstract
A binary discernibility matrix is presented in this paper, upon which a binary matrix-based heuristic reduction algorithm in incomplete information system(IIS) is proposed. In the proposed algorithm, the problem of finding an attribute reduction is converted to the problem of searching a set of binary matrices that can cover the objective binary matrix. The heuristic function in the proposed heuristic reduction algorithm is defined by a discernibility matrix associated with each condition attribute, which denotes the classification significance of the condition attribute. In the proposed heuristic reduction algorithm, attribute reduct is constructed by adding attributes in the sequence of attribute significance. An example of incomplete information system is presented to illustrate the algorithm and its validity.The algorithm is proved to be effective based on an illustrative example.
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
Hu, X.H., Cercone, N.: Learning in relational databases: a rough set approach. Computational Intelligence 11, 323–338 (1995)
Kryszkiewicz, M.: Rough Set Approach to Incomplete Information Systems. Information Sciences 112, 39–49 (1998)
Kryszkiewicz, M.: Rules in Incomplete Information Systems. Information Sciences 113, 271–292 (1999)
Li, H.X., Zhou, X.Z., Huang, B.: Method to determine α in rough set model based on connection degree. Journal of Systems Engineering and Electronics 20(1), 98–105 (2009)
Miao, D.Q., Hu, G.R.: A heuristic algorithm for reduction of knowledge. Journal of Computer Research and Development 36(6), 681–684 (1999) (in Chinese)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)
Pawlak, Z.: Rough classification. International Journal of Man-Machine Studies 20, 469–483 (1984)
Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177(1), 3–27 (2007)
Skowron, A., Rauszer, C.: The discernibility matrices andfunctions in information systems. In: Slowiski, R. (ed.) Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kluwer, Dordrecht (1992)
Stefamowski, J., Tsoukeas, A.: On the Extension of Rough Sets under Incomplete Information. International Journal of Intelligent System 16, 29–38 (1999)
Wang, G.Y.: Calculation methods for core attributes of decision table. Chinese Journal of Computers 26(5), 611–615 (2003)
Wang, G.Y.: Extension of rough set under incomplete information systems. Journal of computer research and development 39(10), 1238–1243 (2002) (in Chinese)
Xu, Z.Y., Liu, Z.P., Yang, B.R., et al.: A quick attribute reduction algorithm with complexity of max(O(|C||U|),O(|C|2|U/C|)). Chinese Journal of Computers 29(3), 391–399 (2006)
Yang, M.: An incremental updating algorithm for attribute reduction based on improved discernibility matrix. Chinese Journal of Computers 29(3), 407–413 (2006)
Yao, Y.Y., Zhao, Y.: Discernibility matrix simplification for constructing attribute reducts. Information Sciences 179(5), 867–882 (2009)
Ye, D.Y., Chen, Z.J.: A new discernibility matrix and the computation of a core. Acta Electronica Sinica 30(7), 1086–1088 (2002) (in Chinese)
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
Li, H., Zhou, X., Zhu, M. (2010). A Heuristic Reduction Algorithm in IIS Based on Binary Matrix. 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_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-16248-0_24
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)