Abstract
This paper presents a new attribute reduction algorithm, ARIMC, for both consistent and inconsistent decision tables. ARIMC eliminates all redundant and inconsistent objects in a decision table, extracts the core attributes when they exist in the decision table in an efficient way, and utilizes the core attributes and their absorptivity as the optimization condition to construct items of the discernibility matrix. Compared with Skowron et al’s reduction algorithm [2], ARIMC shows its advantages in simplicity, practicability and time efficiency.
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 Information Sciences 11, 341–356 (1982)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362 (1992)
Cercone, N.: Learning in relational database: a rough set approach. Computational Intelligence 11(2), 323–337 (1995)
Hu, X.: Knowledge discovery in databases: an attribute-oriented rough set approach. Doctoral Dissertation, University of Regina, Canada (1995)
Wang, G.: Algebra view and information view of rough sets theory. In: Data Mining and knowledge Discovery: Theory, Tools, and Technology III. Proc. SPIE, vol. 4384, pp. 200–207 (2001)
Wang, G.: Calculation methods for core attributes of decision tables. Chinese Journal of Computers 26(5), 1086–1088 (2003)
Liu, Q.: Rough set and its illation. Science press, Beijing (2001)
Hu, K.: A data mining research based on the concept lattice and rough set. Doctoral Dissertation, Tsinghua University, China (2001)
Dai, J., Li, Y.: An algorithm for reduction of attributes in decision system based on rough set. Journal of Mini-Micro Systems 24(3) (2003)
Miao, D., Hu, G.: A heuristic algorithm of knowledge reduction. Journal of Computer Research and Development 36(6), 681–684 (1999)
Wang, G., Yu, H., Yang, D.: Algorithms of reduction in decision tables based on conditional information entropy. Chinese Journal of Computers 25(7), 759–766 (2002)
Ye, D.: A new discernibility matrix and the computation of a core. Acta Electronica Sinica 30(7) (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, X., Shi, J., Wu, X. (2007). A New Algorithm for Attribute Reduction in Decision Tables. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-72530-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72529-9
Online ISBN: 978-3-540-72530-5
eBook Packages: Computer ScienceComputer Science (R0)