Abstract
Attribute core of a decision table is often the start point and key of many information reduction procedures. In this paper, we will study the problem of calculating the attribute core of a decision table. We find some errors in some former results by Hu and Ye [1, 2]. Both definitions of attribute core in the algebra view and information view are studied and their difference is discovered. An algorithm for calculating the attribute core of a decision table in the information view and a systemic method for calculating the attribute core of a decision table in different cases are developed.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hu X., Cercone N.: Learning in Relational Databases: a Rough Set Approach. Computational Intelligence, 2 (1995) 323–337
Ye D. Y., Chen Z. J.: A New Discernibility Matrix and the Computation of a Core. ACTA Electronica Sinica, to appear
Wang G. Y.: Algebra View and Information View of Rough Sets Theory, in Data Mining and Knowledge Discovery: Theory, Tools, and Technology III, Belur V. Dasarathy, Editor, Proceedings of SPIE Vol. 4384 (2001) 200–07
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, G.Y. (2002). Attribute Core of Decision Table. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-45813-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44274-5
Online ISBN: 978-3-540-45813-5
eBook Packages: Springer Book Archive